./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/array-memsafety-realloc/array-realloc-2.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 a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:19:08,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:19:08,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:19:08,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:19:08,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:19:08,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:19:08,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:19:08,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:19:08,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:19:08,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:19:08,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:19:08,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:19:08,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:19:08,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:19:08,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:19:08,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:19:08,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:19:08,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:19:08,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:19:08,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:19:08,271 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:19:08,272 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:19:08,272 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:19:08,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:19:08,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:19:08,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:19:08,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:19:08,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:19:08,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:19:08,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:19:08,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:19:08,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:19:08,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:19:08,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:19:08,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:19:08,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:19:08,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:19:08,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:19:08,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:19:08,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:19:08,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:19:08,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:19:08,278 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 -> a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 [2024-11-17 00:19:08,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:19:08,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:19:08,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:19:08,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:19:08,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:19:08,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2024-11-17 00:19:09,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:19:10,214 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:19:10,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2024-11-17 00:19:10,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68e1f17b/e42b70920d23450a9747cbcde5751f9f/FLAG6e5ef0ef7 [2024-11-17 00:19:10,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68e1f17b/e42b70920d23450a9747cbcde5751f9f [2024-11-17 00:19:10,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:19:10,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:19:10,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:19:10,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:19:10,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:19:10,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:19:10" (1/1) ... [2024-11-17 00:19:10,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241ff24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:10, skipping insertion in model container [2024-11-17 00:19:10,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:19:10" (1/1) ... [2024-11-17 00:19:10,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:19:11,029 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:19:11,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:19:11,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:19:11,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:19:11,128 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:19:11,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11 WrapperNode [2024-11-17 00:19:11,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:19:11,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:19:11,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:19:11,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:19:11,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,169 INFO L138 Inliner]: procedures = 119, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-17 00:19:11,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:19:11,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:19:11,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:19:11,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:19:11,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,191 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-17 00:19:11,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:19:11,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:19:11,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:19:11,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:19:11,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (1/1) ... [2024-11-17 00:19:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:19:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:11,255 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-17 00:19:11,259 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-17 00:19:11,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-17 00:19:11,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:19:11,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:19:11,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-17 00:19:11,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-17 00:19:11,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:19:11,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-17 00:19:11,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:19:11,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:19:11,434 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:19:11,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:19:11,606 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2024-11-17 00:19:11,633 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-17 00:19:11,633 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:19:11,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:19:11,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:19:11,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:11 BoogieIcfgContainer [2024-11-17 00:19:11,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:19:11,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:19:11,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:19:11,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:19:11,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:19:10" (1/3) ... [2024-11-17 00:19:11,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e85efc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:19:11, skipping insertion in model container [2024-11-17 00:19:11,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:11" (2/3) ... [2024-11-17 00:19:11,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e85efc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:19:11, skipping insertion in model container [2024-11-17 00:19:11,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:11" (3/3) ... [2024-11-17 00:19:11,660 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2024-11-17 00:19:11,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:19:11,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-17 00:19:11,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:19:11,742 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;@4eb6c31f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:19:11,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-17 00:19:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:19:11,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:11,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:19:11,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2738746, now seen corresponding path program 1 times [2024-11-17 00:19:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294935112] [2024-11-17 00:19:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:12,011 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-17 00:19:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294935112] [2024-11-17 00:19:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294935112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:12,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:19:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082268452] [2024-11-17 00:19:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:12,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:19:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:12,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:19:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:19:12,051 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:19:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:12,135 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-17 00:19:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:19:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 00:19:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:12,146 INFO L225 Difference]: With dead ends: 59 [2024-11-17 00:19:12,146 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 00:19:12,148 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-17 00:19:12,151 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:12,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 00:19:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-11-17 00:19:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 49 states have internal predecessors, (64), 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-17 00:19:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-17 00:19:12,185 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 4 [2024-11-17 00:19:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:12,186 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-17 00:19:12,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:19:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-17 00:19:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:19:12,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:12,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:19:12,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:19:12,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2738747, now seen corresponding path program 1 times [2024-11-17 00:19:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080255647] [2024-11-17 00:19:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:12,402 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-17 00:19:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080255647] [2024-11-17 00:19:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080255647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:19:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685550642] [2024-11-17 00:19:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:19:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:19:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:19:12,410 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:19:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:12,466 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-11-17 00:19:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:19:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 00:19:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:12,469 INFO L225 Difference]: With dead ends: 59 [2024-11-17 00:19:12,470 INFO L226 Difference]: Without dead ends: 59 [2024-11-17 00:19:12,471 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-17 00:19:12,473 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:12,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-17 00:19:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2024-11-17 00:19:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 53 states have internal predecessors, (69), 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-17 00:19:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-11-17 00:19:12,485 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 4 [2024-11-17 00:19:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-11-17 00:19:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:19:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-11-17 00:19:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:19:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:12,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:19:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:19:12,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 84897718, now seen corresponding path program 1 times [2024-11-17 00:19:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732857709] [2024-11-17 00:19:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:12,521 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-17 00:19:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732857709] [2024-11-17 00:19:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732857709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:19:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070100251] [2024-11-17 00:19:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:19:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:19:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:19:12,525 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:19:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:12,570 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-11-17 00:19:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:19:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-17 00:19:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:12,572 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:19:12,572 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:19:12,572 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-17 00:19:12,574 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:12,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:19:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:19:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.619047619047619) internal successors, (68), 53 states have internal predecessors, (68), 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-17 00:19:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-11-17 00:19:12,584 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 5 [2024-11-17 00:19:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:12,585 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-11-17 00:19:12,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:19:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-11-17 00:19:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:19:12,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:12,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:19:12,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -14381067, now seen corresponding path program 1 times [2024-11-17 00:19:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693134439] [2024-11-17 00:19:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:12,669 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-17 00:19:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693134439] [2024-11-17 00:19:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693134439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809149225] [2024-11-17 00:19:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:12,673 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-17 00:19:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:12,728 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-11-17 00:19:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-17 00:19:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:12,729 INFO L225 Difference]: With dead ends: 66 [2024-11-17 00:19:12,729 INFO L226 Difference]: Without dead ends: 66 [2024-11-17 00:19:12,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:12,734 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-17 00:19:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-11-17 00:19:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 53 states have internal predecessors, (67), 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-17 00:19:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-11-17 00:19:12,741 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 7 [2024-11-17 00:19:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:12,742 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-11-17 00:19:12,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-17 00:19:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-11-17 00:19:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:19:12,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:12,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:12,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:19:12,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash -445713778, now seen corresponding path program 1 times [2024-11-17 00:19:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660255900] [2024-11-17 00:19:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:12,807 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-17 00:19:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660255900] [2024-11-17 00:19:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660255900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:12,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:12,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178643662] [2024-11-17 00:19:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:12,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:12,810 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 00:19:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:12,897 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-17 00:19:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 00:19:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:12,898 INFO L225 Difference]: With dead ends: 64 [2024-11-17 00:19:12,898 INFO L226 Difference]: Without dead ends: 64 [2024-11-17 00:19:12,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:12,900 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:12,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 49 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-17 00:19:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2024-11-17 00:19:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.565217391304348) internal successors, (72), 56 states have internal predecessors, (72), 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-17 00:19:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2024-11-17 00:19:12,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 8 [2024-11-17 00:19:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:12,905 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2024-11-17 00:19:12,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 00:19:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-11-17 00:19:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:19:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:12,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:12,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:19:12,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -445713777, now seen corresponding path program 1 times [2024-11-17 00:19:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139152913] [2024-11-17 00:19:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,013 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-17 00:19:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139152913] [2024-11-17 00:19:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139152913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640909759] [2024-11-17 00:19:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:19:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:19:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:13,015 INFO L87 Difference]: Start difference. First operand 57 states and 72 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-17 00:19:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,066 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2024-11-17 00:19:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:13,068 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-17 00:19:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,069 INFO L225 Difference]: With dead ends: 60 [2024-11-17 00:19:13,069 INFO L226 Difference]: Without dead ends: 60 [2024-11-17 00:19:13,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:13,070 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 73 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-17 00:19:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-17 00:19:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.553191489361702) internal successors, (73), 57 states have internal predecessors, (73), 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-17 00:19:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-17 00:19:13,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 8 [2024-11-17 00:19:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-17 00:19:13,083 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-17 00:19:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-17 00:19:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:19:13,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:19:13,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1777321554, now seen corresponding path program 1 times [2024-11-17 00:19:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962702691] [2024-11-17 00:19:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,145 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-17 00:19:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962702691] [2024-11-17 00:19:13,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962702691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850319831] [2024-11-17 00:19:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,150 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-17 00:19:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,173 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-17 00:19:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Word has length 11 [2024-11-17 00:19:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,175 INFO L225 Difference]: With dead ends: 55 [2024-11-17 00:19:13,175 INFO L226 Difference]: Without dead ends: 55 [2024-11-17 00:19:13,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,176 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 63 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-17 00:19:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-17 00:19:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 54 states have internal predecessors, (69), 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-17 00:19:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-11-17 00:19:13,186 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 11 [2024-11-17 00:19:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,186 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-11-17 00:19:13,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-17 00:19:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-11-17 00:19:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:19:13,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:19:13,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash 917491823, now seen corresponding path program 1 times [2024-11-17 00:19:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428589019] [2024-11-17 00:19:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,281 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-17 00:19:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428589019] [2024-11-17 00:19:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428589019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557685716] [2024-11-17 00:19:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,284 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-17 00:19:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,327 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-17 00:19:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:13,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) Word has length 13 [2024-11-17 00:19:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,328 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:19:13,328 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:19:13,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,329 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:19:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:19:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.5) internal successors, (66), 53 states have internal predecessors, (66), 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-17 00:19:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-11-17 00:19:13,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 13 [2024-11-17 00:19:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-11-17 00:19:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-17 00:19:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-11-17 00:19:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:19:13,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:19:13,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 917491824, now seen corresponding path program 1 times [2024-11-17 00:19:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956654704] [2024-11-17 00:19:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,439 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-17 00:19:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956654704] [2024-11-17 00:19:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956654704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:19:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28229059] [2024-11-17 00:19:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:19:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:19:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:13,445 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-17 00:19:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,511 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-17 00:19:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:19:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Word has length 13 [2024-11-17 00:19:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,513 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:19:13,513 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:19:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:19:13,514 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 137 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:19:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 00:19:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 42 states have internal predecessors, (48), 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-17 00:19:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-17 00:19:13,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2024-11-17 00:19:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-17 00:19:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-17 00:19:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-17 00:19:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:19:13,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:19:13,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 917551406, now seen corresponding path program 1 times [2024-11-17 00:19:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269572188] [2024-11-17 00:19:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,715 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-17 00:19:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269572188] [2024-11-17 00:19:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269572188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:19:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396135021] [2024-11-17 00:19:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:19:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:19:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:19:13,718 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-17 00:19:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,825 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-17 00:19:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:19:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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) Word has length 13 [2024-11-17 00:19:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,829 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:19:13,829 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:19:13,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:19:13,830 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 131 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:19:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2024-11-17 00:19:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 45 states have internal predecessors, (52), 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-17 00:19:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-17 00:19:13,836 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2024-11-17 00:19:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,836 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-17 00:19:13,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-17 00:19:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-17 00:19:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:19:13,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:19:13,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1620678712, now seen corresponding path program 1 times [2024-11-17 00:19:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845096282] [2024-11-17 00:19:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:13,891 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-17 00:19:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845096282] [2024-11-17 00:19:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845096282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224560496] [2024-11-17 00:19:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:13,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,894 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:13,915 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-17 00:19:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-17 00:19:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:13,916 INFO L225 Difference]: With dead ends: 46 [2024-11-17 00:19:13,916 INFO L226 Difference]: Without dead ends: 46 [2024-11-17 00:19:13,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:13,917 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:13,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-17 00:19:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-17 00:19:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 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-17 00:19:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-17 00:19:13,922 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2024-11-17 00:19:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-17 00:19:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-17 00:19:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:19:13,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:13,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:19:13,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:13,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1620677527, now seen corresponding path program 1 times [2024-11-17 00:19:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785638712] [2024-11-17 00:19:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:14,201 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-17 00:19:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:14,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785638712] [2024-11-17 00:19:14,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785638712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:14,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:19:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565665712] [2024-11-17 00:19:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:14,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:19:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:19:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:19:14,203 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:14,339 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-17 00:19:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:19:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-17 00:19:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:14,342 INFO L225 Difference]: With dead ends: 48 [2024-11-17 00:19:14,342 INFO L226 Difference]: Without dead ends: 48 [2024-11-17 00:19:14,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:19:14,343 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:14,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 96 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-17 00:19:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-17 00:19:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 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-17 00:19:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-17 00:19:14,349 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2024-11-17 00:19:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:14,350 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-17 00:19:14,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-17 00:19:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:19:14,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:14,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:14,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:19:14,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:14,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1620677526, now seen corresponding path program 1 times [2024-11-17 00:19:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137294645] [2024-11-17 00:19:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:14,500 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-17 00:19:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137294645] [2024-11-17 00:19:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137294645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:14,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:19:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44271289] [2024-11-17 00:19:14,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:14,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:19:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:19:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:14,503 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:14,560 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-17 00:19:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-17 00:19:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:14,561 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:19:14,561 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:19:14,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:19:14,562 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:14,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:19:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 00:19:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.25) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2024-11-17 00:19:14,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 14 [2024-11-17 00:19:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-11-17 00:19:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-11-17 00:19:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:19:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:14,565 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:19:14,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1136002744, now seen corresponding path program 1 times [2024-11-17 00:19:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540454315] [2024-11-17 00:19:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540454315] [2024-11-17 00:19:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540454315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104663144] [2024-11-17 00:19:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:14,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:14,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:19:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:14,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:19:14,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:14,850 INFO L349 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2024-11-17 00:19:14,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2024-11-17 00:19:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:15,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104663144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:15,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 10 [2024-11-17 00:19:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860280152] [2024-11-17 00:19:15,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:19:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:19:15,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:19:15,114 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:15,175 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2024-11-17 00:19:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:19:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:15,176 INFO L225 Difference]: With dead ends: 44 [2024-11-17 00:19:15,176 INFO L226 Difference]: Without dead ends: 44 [2024-11-17 00:19:15,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:19:15,177 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 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-11-17 00:19:15,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-17 00:19:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-17 00:19:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 41 states have internal predecessors, (44), 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-17 00:19:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-17 00:19:15,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2024-11-17 00:19:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:15,180 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-17 00:19:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-17 00:19:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:19:15,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:15,181 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:15,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:19:15,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:19:15,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:15,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -856346715, now seen corresponding path program 1 times [2024-11-17 00:19:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877182327] [2024-11-17 00:19:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877182327] [2024-11-17 00:19:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877182327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989336641] [2024-11-17 00:19:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:15,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:15,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:19:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:15,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:19:15,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:15,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:19:16,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:19:16,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:19:16,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-17 00:19:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:16,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:16,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-17 00:19:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989336641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:16,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:16,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 19 [2024-11-17 00:19:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907268903] [2024-11-17 00:19:16,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 00:19:16,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 00:19:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:19:16,379 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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-17 00:19:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:16,772 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-17 00:19:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:19:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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 21 [2024-11-17 00:19:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:16,773 INFO L225 Difference]: With dead ends: 48 [2024-11-17 00:19:16,773 INFO L226 Difference]: Without dead ends: 48 [2024-11-17 00:19:16,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2024-11-17 00:19:16,776 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:16,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:19:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-17 00:19:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-11-17 00:19:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 40 states have internal predecessors, (43), 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-17 00:19:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-17 00:19:16,778 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 21 [2024-11-17 00:19:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:16,778 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-17 00:19:16,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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-17 00:19:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-17 00:19:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:19:16,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:16,781 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:16,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:19:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 00:19:16,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:16,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash -776944410, now seen corresponding path program 1 times [2024-11-17 00:19:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656939279] [2024-11-17 00:19:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656939279] [2024-11-17 00:19:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656939279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312861809] [2024-11-17 00:19:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:17,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:17,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:17,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:19:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:17,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:19:17,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:19:17,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:19:17,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:19:17,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2024-11-17 00:19:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:17,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:17,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-17 00:19:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312861809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:17,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2024-11-17 00:19:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497623766] [2024-11-17 00:19:17,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:19:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:19:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:19:17,632 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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-17 00:19:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:17,799 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-17 00:19:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:19:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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 22 [2024-11-17 00:19:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:17,800 INFO L225 Difference]: With dead ends: 41 [2024-11-17 00:19:17,800 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 00:19:17,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:19:17,801 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:17,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 66 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 00:19:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-17 00:19:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 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-17 00:19:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-11-17 00:19:17,803 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 22 [2024-11-17 00:19:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-11-17 00:19:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 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-17 00:19:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-17 00:19:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:19:17,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:17,804 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:17,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:19:18,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:18,005 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1684527043, now seen corresponding path program 1 times [2024-11-17 00:19:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:18,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149886079] [2024-11-17 00:19:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149886079] [2024-11-17 00:19:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149886079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341189277] [2024-11-17 00:19:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:18,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:18,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:19:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:18,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 00:19:18,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:18,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:19:18,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:19:18,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:19:18,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2024-11-17 00:19:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:18,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:18,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-17 00:19:18,500 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-17 00:19:18,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-17 00:19:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341189277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:18,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-11-17 00:19:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148745818] [2024-11-17 00:19:18,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:19:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:19:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:19:18,563 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 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-17 00:19:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:18,653 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-17 00:19:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:19:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 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 23 [2024-11-17 00:19:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:18,654 INFO L225 Difference]: With dead ends: 40 [2024-11-17 00:19:18,654 INFO L226 Difference]: Without dead ends: 40 [2024-11-17 00:19:18,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:19:18,655 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:18,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-17 00:19:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-17 00:19:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 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-17 00:19:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-17 00:19:18,657 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 23 [2024-11-17 00:19:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-17 00:19:18,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 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-17 00:19:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-17 00:19:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:19:18,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:18,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:18,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:19:18,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 00:19:18,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:18,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash -301977341, now seen corresponding path program 1 times [2024-11-17 00:19:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137250160] [2024-11-17 00:19:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137250160] [2024-11-17 00:19:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137250160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:19:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391873680] [2024-11-17 00:19:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:19:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:19:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:19:18,968 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-17 00:19:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:19,036 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2024-11-17 00:19:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:19:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2024-11-17 00:19:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:19,037 INFO L225 Difference]: With dead ends: 36 [2024-11-17 00:19:19,037 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 00:19:19,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:19:19,038 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:19,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 00:19:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 00:19:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-17 00:19:19,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2024-11-17 00:19:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:19,040 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-11-17 00:19:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-17 00:19:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-17 00:19:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:19:19,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:19,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:19,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:19:19,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:19,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -301917759, now seen corresponding path program 1 times [2024-11-17 00:19:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:19,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359955861] [2024-11-17 00:19:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359955861] [2024-11-17 00:19:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359955861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128837090] [2024-11-17 00:19:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:19,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:19,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:19:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:19,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:19:19,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:19:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:19,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128837090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:19,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-17 00:19:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944843875] [2024-11-17 00:19:19,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 00:19:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 00:19:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:19:19,604 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 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-17 00:19:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:20,005 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2024-11-17 00:19:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:19:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 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 23 [2024-11-17 00:19:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:20,006 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:19:20,006 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:19:20,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-11-17 00:19:20,007 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 192 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:20,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 263 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:19:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:19:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 75. [2024-11-17 00:19:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 74 states have internal predecessors, (82), 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-17 00:19:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-11-17 00:19:20,010 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2024-11-17 00:19:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:20,011 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-11-17 00:19:20,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 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-17 00:19:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-17 00:19:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:19:20,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:20,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:20,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:19:20,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:20,216 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:20,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash -769515978, now seen corresponding path program 1 times [2024-11-17 00:19:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454853412] [2024-11-17 00:19:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454853412] [2024-11-17 00:19:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454853412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598069799] [2024-11-17 00:19:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:20,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:20,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:20,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:19:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:20,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:19:20,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:20,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:19:20,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:19:20,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:19:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:19:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:19:20,763 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:19:20,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-11-17 00:19:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:20,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:20,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-17 00:19:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598069799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:20,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-17 00:19:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701187344] [2024-11-17 00:19:20,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:20,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:19:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:19:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:19:20,987 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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-17 00:19:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:21,197 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-17 00:19:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:19:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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 24 [2024-11-17 00:19:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:21,199 INFO L225 Difference]: With dead ends: 74 [2024-11-17 00:19:21,199 INFO L226 Difference]: Without dead ends: 74 [2024-11-17 00:19:21,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:19:21,200 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:21,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 92 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-17 00:19:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-17 00:19:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 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-17 00:19:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-17 00:19:21,203 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2024-11-17 00:19:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:21,203 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-17 00:19:21,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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-17 00:19:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-17 00:19:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:19:21,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:21,204 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:21,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 00:19:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:21,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:21,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1347227619, now seen corresponding path program 1 times [2024-11-17 00:19:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290621561] [2024-11-17 00:19:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290621561] [2024-11-17 00:19:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290621561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334430469] [2024-11-17 00:19:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:21,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:21,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:21,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:21,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:19:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:21,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-17 00:19:21,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:22,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:19:22,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-17 00:19:22,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:19:22,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:19:22,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-17 00:19:22,620 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base_23| Int) (|v_ULTIMATE.start_main_~#a~0#1.base_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_13| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21| 1))) (and (<= (+ |v_ULTIMATE.start_main_#t~mem8#1.base_13| 2) |v_ULTIMATE.start_main_~#a~0#1.base_21|) (= (select (store .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base_23| 0) |v_ULTIMATE.start_main_#t~mem8#1.base_13|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21|) 0) (= (select .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base_23|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base_23| 0) |v_ULTIMATE.start_main_#t~mem8#1.base_13| 0) |v_ULTIMATE.start_main_~#a~0#1.base_21| 0))))) is different from true [2024-11-17 00:19:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:22,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:22,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-17 00:19:36,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:19:36,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 192 [2024-11-17 00:19:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334430469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:36,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2024-11-17 00:19:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981758943] [2024-11-17 00:19:36,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:19:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:19:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=4, NotChecked=46, Total=650 [2024-11-17 00:19:36,471 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 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-17 00:19:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,520 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-17 00:19:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:19:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 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 26 [2024-11-17 00:19:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,521 INFO L225 Difference]: With dead ends: 82 [2024-11-17 00:19:37,521 INFO L226 Difference]: Without dead ends: 64 [2024-11-17 00:19:37,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=4, NotChecked=62, Total=1122 [2024-11-17 00:19:37,522 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:37,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2024-11-17 00:19:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-17 00:19:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-17 00:19:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 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-17 00:19:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2024-11-17 00:19:37,525 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 26 [2024-11-17 00:19:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,525 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2024-11-17 00:19:37,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 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-17 00:19:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2024-11-17 00:19:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:19:37,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,527 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:19:37,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:37,732 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -631380339, now seen corresponding path program 2 times [2024-11-17 00:19:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711929703] [2024-11-17 00:19:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711929703] [2024-11-17 00:19:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711929703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017112277] [2024-11-17 00:19:38,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:19:38,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:38,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:38,208 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:38,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:19:38,393 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:19:38,394 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:19:38,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:19:38,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:38,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:19:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:38,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017112277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:39,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-17 00:19:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886107107] [2024-11-17 00:19:39,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:19:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:19:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:19:39,070 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 25 states, 24 states have (on average 5.291666666666667) internal successors, (127), 25 states have internal predecessors, (127), 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-17 00:19:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:40,569 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2024-11-17 00:19:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-17 00:19:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.291666666666667) internal successors, (127), 25 states have internal predecessors, (127), 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 63 [2024-11-17 00:19:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:40,570 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:19:40,570 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:19:40,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=876, Invalid=3414, Unknown=0, NotChecked=0, Total=4290 [2024-11-17 00:19:40,573 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:40,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 264 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:19:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:19:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-17 00:19:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.006993006993007) internal successors, (144), 143 states have internal predecessors, (144), 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-17 00:19:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2024-11-17 00:19:40,576 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 63 [2024-11-17 00:19:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:40,577 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2024-11-17 00:19:40,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.291666666666667) internal successors, (127), 25 states have internal predecessors, (127), 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-17 00:19:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2024-11-17 00:19:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-17 00:19:40,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:40,581 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:40,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:19:40,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:19:40,782 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2024-11-17 00:19:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1379290149, now seen corresponding path program 3 times [2024-11-17 00:19:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017239913] [2024-11-17 00:19:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:42,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:42,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017239913] [2024-11-17 00:19:42,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017239913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:42,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780949746] [2024-11-17 00:19:42,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:19:42,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:42,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:42,157 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:19:42,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:19:42,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:19:42,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:19:42,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:19:42,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:42,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:19:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 86 proven. 78 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-11-17 00:19:42,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-11-17 00:19:43,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780949746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:43,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 35 [2024-11-17 00:19:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23380447] [2024-11-17 00:19:43,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:43,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-17 00:19:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-17 00:19:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:19:43,561 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand has 36 states, 35 states have (on average 5.628571428571429) internal successors, (197), 36 states have internal predecessors, (197), 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-17 00:19:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:45,974 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2024-11-17 00:19:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-17 00:19:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.628571428571429) internal successors, (197), 36 states have internal predecessors, (197), 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 143 [2024-11-17 00:19:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:45,975 INFO L225 Difference]: With dead ends: 157 [2024-11-17 00:19:45,975 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:19:45,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=964, Invalid=8348, Unknown=0, NotChecked=0, Total=9312 [2024-11-17 00:19:45,978 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 147 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:45,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 932 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:19:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:19:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:19:45,978 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-17 00:19:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:19:45,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2024-11-17 00:19:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:45,979 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:19:45,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.628571428571429) internal successors, (197), 36 states have internal predecessors, (197), 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-17 00:19:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:19:45,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:19:45,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-17 00:19:45,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (12 of 14 remaining) [2024-11-17 00:19:45,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (11 of 14 remaining) [2024-11-17 00:19:45,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (10 of 14 remaining) [2024-11-17 00:19:45,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-17 00:19:45,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-17 00:19:45,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:19:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:46,187 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:46,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:19:46,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:19:46 BoogieIcfgContainer [2024-11-17 00:19:46,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:19:46,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:19:46,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:19:46,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:19:46,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:11" (3/4) ... [2024-11-17 00:19:46,195 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:19:46,203 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-17 00:19:46,204 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-17 00:19:46,204 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-17 00:19:46,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-17 00:19:46,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:19:46,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:19:46,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:19:46,295 INFO L158 Benchmark]: Toolchain (without parser) took 35725.28ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 105.2MB in the beginning and 108.0MB in the end (delta: -2.8MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,295 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:19:46,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.97ms. Allocated memory is still 169.9MB. Free memory was 104.7MB in the beginning and 133.7MB in the end (delta: -29.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.19ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 131.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,295 INFO L158 Benchmark]: Boogie Preprocessor took 40.59ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 130.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:19:46,295 INFO L158 Benchmark]: IcfgBuilder took 436.55ms. Allocated memory is still 169.9MB. Free memory was 129.5MB in the beginning and 113.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,296 INFO L158 Benchmark]: TraceAbstraction took 34540.07ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 112.7MB in the beginning and 112.8MB in the end (delta: -52.7kB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,296 INFO L158 Benchmark]: Witness Printer took 101.94ms. Allocated memory is still 297.8MB. Free memory was 111.7MB in the beginning and 108.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:19:46,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.97ms. Allocated memory is still 169.9MB. Free memory was 104.7MB in the beginning and 133.7MB in the end (delta: -29.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.19ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 131.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.59ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 130.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 436.55ms. Allocated memory is still 169.9MB. Free memory was 129.5MB in the beginning and 113.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34540.07ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 112.7MB in the beginning and 112.8MB in the end (delta: -52.7kB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. * Witness Printer took 101.94ms. Allocated memory is still 297.8MB. Free memory was 111.7MB in the beginning and 108.0MB in the end (delta: 3.7MB). 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: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: 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: -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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 23, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 3079 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 2477 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4780 IncrementalHoareTripleChecker+Invalid, 4926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 602 mSDtfsCounter, 4780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 634 SyntacticMatches, 8 SemanticMatches, 375 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4052 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=22, InterpolantAutomatonStates: 287, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 128 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 881 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1205 ConstructedInterpolants, 48 QuantifiedInterpolants, 11129 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1890 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 41 InterpolantComputations, 14 PerfectInterpolantSequences, 1534/3161 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-11-17 00:19:46,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE