./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/forester-heap/sll-01-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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:24:38,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:24:38,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:24:38,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:24:38,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:24:38,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:24:38,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:24:38,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:24:38,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:24:38,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:24:38,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:24:38,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:24:38,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:24:38,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:24:38,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:24:38,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:24:38,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:24:38,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:24:38,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:24:38,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:24:38,204 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:24:38,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:24:38,208 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:24:38,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:24:38,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:24:38,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:24:38,209 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:24:38,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:24:38,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:24:38,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:24:38,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:24:38,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:24:38,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:24:38,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:24:38,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:24:38,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:24:38,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:24:38,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:24:38,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:24:38,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:24:38,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:24:38,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:24:38,214 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2024-11-10 15:24:38,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:24:38,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:24:38,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:24:38,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:24:38,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:24:38,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-10 15:24:40,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:24:40,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:24:40,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-10 15:24:40,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e502fad/7bc5e757a3ad442a84e491cb1aa7b214/FLAGa9bd98b5b [2024-11-10 15:24:40,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e502fad/7bc5e757a3ad442a84e491cb1aa7b214 [2024-11-10 15:24:40,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:24:40,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:24:40,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:24:40,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:24:40,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:24:40,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:40" (1/1) ... [2024-11-10 15:24:40,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13eec92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:40, skipping insertion in model container [2024-11-10 15:24:40,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:40" (1/1) ... [2024-11-10 15:24:40,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:24:41,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:24:41,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:24:41,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:24:41,116 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:24:41,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41 WrapperNode [2024-11-10 15:24:41,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:24:41,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:24:41,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:24:41,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:24:41,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,173 INFO L138 Inliner]: procedures = 119, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2024-11-10 15:24:41,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:24:41,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:24:41,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:24:41,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:24:41,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,228 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-10 15:24:41,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:24:41,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:24:41,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:24:41,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:24:41,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (1/1) ... [2024-11-10 15:24:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:24:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:41,303 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-10 15:24:41,305 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-10 15:24:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 15:24:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:24:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:24:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:24:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:24:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:24:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:24:41,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:24:41,466 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:24:41,468 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:24:41,991 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-10 15:24:41,991 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:24:42,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:24:42,022 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:24:42,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:42 BoogieIcfgContainer [2024-11-10 15:24:42,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:24:42,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:24:42,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:24:42,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:24:42,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:40" (1/3) ... [2024-11-10 15:24:42,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6826a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:42, skipping insertion in model container [2024-11-10 15:24:42,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:41" (2/3) ... [2024-11-10 15:24:42,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6826a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:42, skipping insertion in model container [2024-11-10 15:24:42,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:42" (3/3) ... [2024-11-10 15:24:42,030 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2024-11-10 15:24:42,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:24:42,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-11-10 15:24:42,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:24:42,106 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;@61c5c4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:24:42,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-11-10 15:24:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 137 states have (on average 1.897810218978102) internal successors, (260), 205 states have internal predecessors, (260), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 15:24:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:24:42,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:42,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:24:42,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 303825, now seen corresponding path program 1 times [2024-11-10 15:24:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:42,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007998490] [2024-11-10 15:24:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:42,413 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-10 15:24:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007998490] [2024-11-10 15:24:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007998490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:42,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194310958] [2024-11-10 15:24:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:42,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:42,459 INFO L87 Difference]: Start difference. First operand has 220 states, 137 states have (on average 1.897810218978102) internal successors, (260), 205 states have internal predecessors, (260), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:42,685 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2024-11-10 15:24:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:42,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:24:42,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:42,699 INFO L225 Difference]: With dead ends: 201 [2024-11-10 15:24:42,699 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 15:24:42,701 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-10 15:24:42,705 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 178 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:42,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 149 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 15:24:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-10 15:24:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 125 states have (on average 1.68) internal successors, (210), 196 states have internal predecessors, (210), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2024-11-10 15:24:42,764 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 3 [2024-11-10 15:24:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2024-11-10 15:24:42,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2024-11-10 15:24:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:24:42,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:42,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:24:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:24:42,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 303826, now seen corresponding path program 1 times [2024-11-10 15:24:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521100022] [2024-11-10 15:24:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:42,900 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-10 15:24:42,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:42,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521100022] [2024-11-10 15:24:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521100022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:42,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563089984] [2024-11-10 15:24:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:42,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:42,906 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:43,081 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2024-11-10 15:24:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:24:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:43,084 INFO L225 Difference]: With dead ends: 222 [2024-11-10 15:24:43,084 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 15:24:43,084 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-10 15:24:43,085 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 175 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:43,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 178 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 15:24:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2024-11-10 15:24:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 210 states have internal predecessors, (235), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 248 transitions. [2024-11-10 15:24:43,106 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 248 transitions. Word has length 3 [2024-11-10 15:24:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:43,106 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 248 transitions. [2024-11-10 15:24:43,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 248 transitions. [2024-11-10 15:24:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:24:43,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:43,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:43,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:24:43,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1172023998, now seen corresponding path program 1 times [2024-11-10 15:24:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667706095] [2024-11-10 15:24:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:43,170 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-10 15:24:43,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667706095] [2024-11-10 15:24:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667706095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355984697] [2024-11-10 15:24:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:43,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:43,175 INFO L87 Difference]: Start difference. First operand 212 states and 248 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:43,224 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2024-11-10 15:24:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:43,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:24:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:43,227 INFO L225 Difference]: With dead ends: 224 [2024-11-10 15:24:43,227 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 15:24:43,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:24:43,228 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 178 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:43,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 239 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 15:24:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-10 15:24:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 146 states have (on average 1.595890410958904) internal successors, (233), 209 states have internal predecessors, (233), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2024-11-10 15:24:43,244 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 8 [2024-11-10 15:24:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2024-11-10 15:24:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2024-11-10 15:24:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:24:43,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:43,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:24:43,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1633412747, now seen corresponding path program 1 times [2024-11-10 15:24:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192404751] [2024-11-10 15:24:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:43,425 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-10 15:24:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192404751] [2024-11-10 15:24:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192404751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:43,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147462500] [2024-11-10 15:24:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:43,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:43,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:43,428 INFO L87 Difference]: Start difference. First operand 211 states and 245 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:43,604 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2024-11-10 15:24:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 15:24:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:43,606 INFO L225 Difference]: With dead ends: 210 [2024-11-10 15:24:43,606 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 15:24:43,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:43,607 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 2 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:43,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 614 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 15:24:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-10 15:24:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 146 states have (on average 1.5890410958904109) internal successors, (232), 208 states have internal predecessors, (232), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2024-11-10 15:24:43,626 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 12 [2024-11-10 15:24:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:43,655 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2024-11-10 15:24:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2024-11-10 15:24:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:24:43,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:43,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:43,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:24:43,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1633412746, now seen corresponding path program 1 times [2024-11-10 15:24:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116972130] [2024-11-10 15:24:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:43,899 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-10 15:24:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116972130] [2024-11-10 15:24:43,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116972130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:43,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:43,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:43,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201886478] [2024-11-10 15:24:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:43,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:43,904 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:44,086 INFO L93 Difference]: Finished difference Result 209 states and 243 transitions. [2024-11-10 15:24:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:44,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 15:24:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:44,088 INFO L225 Difference]: With dead ends: 209 [2024-11-10 15:24:44,088 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 15:24:44,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:44,093 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:44,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 630 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 15:24:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 15:24:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 146 states have (on average 1.582191780821918) internal successors, (231), 207 states have internal predecessors, (231), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2024-11-10 15:24:44,105 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 12 [2024-11-10 15:24:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:44,105 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2024-11-10 15:24:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2024-11-10 15:24:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:24:44,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:44,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:24:44,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 980537157, now seen corresponding path program 1 times [2024-11-10 15:24:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184174158] [2024-11-10 15:24:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:44,319 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-10 15:24:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184174158] [2024-11-10 15:24:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184174158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641005942] [2024-11-10 15:24:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:44,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:24:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:24:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:44,322 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10 15:24:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:44,740 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2024-11-10 15:24:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:24:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2024-11-10 15:24:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:44,742 INFO L225 Difference]: With dead ends: 208 [2024-11-10 15:24:44,742 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 15:24:44,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:44,744 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 173 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:44,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 733 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 15:24:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-10 15:24:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 146 states have (on average 1.5753424657534247) internal successors, (230), 206 states have internal predecessors, (230), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2024-11-10 15:24:44,751 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 15 [2024-11-10 15:24:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2024-11-10 15:24:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10 15:24:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2024-11-10 15:24:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:24:44,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:44,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:24:44,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 980537158, now seen corresponding path program 1 times [2024-11-10 15:24:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245729410] [2024-11-10 15:24:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:45,064 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-10 15:24:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245729410] [2024-11-10 15:24:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245729410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335724680] [2024-11-10 15:24:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:24:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:24:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:45,068 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10 15:24:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:45,382 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2024-11-10 15:24:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:24:45,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2024-11-10 15:24:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:45,384 INFO L225 Difference]: With dead ends: 207 [2024-11-10 15:24:45,384 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 15:24:45,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:45,385 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 172 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:45,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 15:24:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-10 15:24:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.5684931506849316) internal successors, (229), 205 states have internal predecessors, (229), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2024-11-10 15:24:45,395 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 15 [2024-11-10 15:24:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:45,395 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2024-11-10 15:24:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10 15:24:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2024-11-10 15:24:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:24:45,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:45,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:45,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:24:45,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:45,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash -481092018, now seen corresponding path program 1 times [2024-11-10 15:24:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229483519] [2024-11-10 15:24:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:45,419 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-10 15:24:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229483519] [2024-11-10 15:24:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229483519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620399462] [2024-11-10 15:24:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:45,422 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:45,431 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2024-11-10 15:24:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 15:24:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:45,432 INFO L225 Difference]: With dead ends: 208 [2024-11-10 15:24:45,432 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 15:24:45,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:24:45,433 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:45,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 15:24:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-10 15:24:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 147 states have (on average 1.564625850340136) internal successors, (230), 206 states have internal predecessors, (230), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2024-11-10 15:24:45,437 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 17 [2024-11-10 15:24:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:45,447 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2024-11-10 15:24:45,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2024-11-10 15:24:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:24:45,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:45,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:24:45,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1854100178, now seen corresponding path program 1 times [2024-11-10 15:24:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051345659] [2024-11-10 15:24:45,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:45,591 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-10 15:24:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:45,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051345659] [2024-11-10 15:24:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051345659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:45,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438026560] [2024-11-10 15:24:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:24:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:24:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:45,594 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:45,823 INFO L93 Difference]: Finished difference Result 302 states and 351 transitions. [2024-11-10 15:24:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:24:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:45,825 INFO L225 Difference]: With dead ends: 302 [2024-11-10 15:24:45,825 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 15:24:45,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:45,826 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:45,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 964 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 15:24:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2024-11-10 15:24:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 146 states have (on average 1.5616438356164384) internal successors, (228), 204 states have internal predecessors, (228), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2024-11-10 15:24:45,831 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 19 [2024-11-10 15:24:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2024-11-10 15:24:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2024-11-10 15:24:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:24:45,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:45,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:24:45,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1490344090, now seen corresponding path program 1 times [2024-11-10 15:24:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781180119] [2024-11-10 15:24:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:45,935 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-10 15:24:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781180119] [2024-11-10 15:24:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781180119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139712541] [2024-11-10 15:24:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:45,937 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10 15:24:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:46,082 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2024-11-10 15:24:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:46,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-10 15:24:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:46,084 INFO L225 Difference]: With dead ends: 303 [2024-11-10 15:24:46,084 INFO L226 Difference]: Without dead ends: 303 [2024-11-10 15:24:46,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:46,085 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 99 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:46,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 684 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-10 15:24:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 210. [2024-11-10 15:24:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 150 states have (on average 1.5466666666666666) internal successors, (232), 208 states have internal predecessors, (232), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2024-11-10 15:24:46,093 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 19 [2024-11-10 15:24:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2024-11-10 15:24:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10 15:24:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2024-11-10 15:24:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:24:46,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:46,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:24:46,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:46,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 584462202, now seen corresponding path program 1 times [2024-11-10 15:24:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554814417] [2024-11-10 15:24:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:46,161 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-10 15:24:46,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:46,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554814417] [2024-11-10 15:24:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554814417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436778651] [2024-11-10 15:24:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:46,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:46,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:46,163 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:46,317 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2024-11-10 15:24:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 15:24:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:46,319 INFO L225 Difference]: With dead ends: 202 [2024-11-10 15:24:46,319 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 15:24:46,319 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-10 15:24:46,320 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 244 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:46,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 148 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 15:24:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-10 15:24:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 200 states have internal predecessors, (224), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2024-11-10 15:24:46,324 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 21 [2024-11-10 15:24:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:46,324 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2024-11-10 15:24:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2024-11-10 15:24:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:24:46,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:46,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:24:46,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 584462203, now seen corresponding path program 1 times [2024-11-10 15:24:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:46,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740466441] [2024-11-10 15:24:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:46,474 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-10 15:24:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740466441] [2024-11-10 15:24:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740466441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12130267] [2024-11-10 15:24:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:46,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:46,476 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:46,679 INFO L93 Difference]: Finished difference Result 252 states and 287 transitions. [2024-11-10 15:24:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:46,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 15:24:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:46,681 INFO L225 Difference]: With dead ends: 252 [2024-11-10 15:24:46,681 INFO L226 Difference]: Without dead ends: 252 [2024-11-10 15:24:46,681 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-10 15:24:46,682 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 240 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:46,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 246 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-10 15:24:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 231. [2024-11-10 15:24:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 182 states have (on average 1.4725274725274726) internal successors, (268), 229 states have internal predecessors, (268), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 279 transitions. [2024-11-10 15:24:46,688 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 279 transitions. Word has length 21 [2024-11-10 15:24:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 279 transitions. [2024-11-10 15:24:46,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 279 transitions. [2024-11-10 15:24:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:24:46,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:46,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:46,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:24:46,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1630268908, now seen corresponding path program 1 times [2024-11-10 15:24:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:46,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873036386] [2024-11-10 15:24:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:46,730 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-10 15:24:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873036386] [2024-11-10 15:24:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873036386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748917119] [2024-11-10 15:24:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:46,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:24:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:24:46,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:24:46,733 INFO L87 Difference]: Start difference. First operand 231 states and 279 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:46,836 INFO L93 Difference]: Finished difference Result 254 states and 288 transitions. [2024-11-10 15:24:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:24:46,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-10 15:24:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:46,837 INFO L225 Difference]: With dead ends: 254 [2024-11-10 15:24:46,837 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 15:24:46,838 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-10 15:24:46,838 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 240 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:46,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 329 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 15:24:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 230. [2024-11-10 15:24:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 228 states have internal predecessors, (266), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2024-11-10 15:24:46,843 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 26 [2024-11-10 15:24:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:46,843 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2024-11-10 15:24:46,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2024-11-10 15:24:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:24:46,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:46,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:46,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:24:46,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1697831924, now seen corresponding path program 1 times [2024-11-10 15:24:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453972865] [2024-11-10 15:24:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:46,936 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-10 15:24:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453972865] [2024-11-10 15:24:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453972865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101164279] [2024-11-10 15:24:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:24:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:24:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:46,938 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-10 15:24:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:47,179 INFO L93 Difference]: Finished difference Result 230 states and 276 transitions. [2024-11-10 15:24:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:24:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2024-11-10 15:24:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:47,180 INFO L225 Difference]: With dead ends: 230 [2024-11-10 15:24:47,180 INFO L226 Difference]: Without dead ends: 230 [2024-11-10 15:24:47,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:47,181 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 88 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:47,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 503 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-10 15:24:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2024-11-10 15:24:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.456043956043956) internal successors, (265), 227 states have internal predecessors, (265), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2024-11-10 15:24:47,186 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 275 transitions. Word has length 25 [2024-11-10 15:24:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:47,186 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 275 transitions. [2024-11-10 15:24:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-10 15:24:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2024-11-10 15:24:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:24:47,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:47,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:24:47,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1697831925, now seen corresponding path program 1 times [2024-11-10 15:24:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986530066] [2024-11-10 15:24:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,365 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-10 15:24:47,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:47,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986530066] [2024-11-10 15:24:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986530066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:47,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:24:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693652051] [2024-11-10 15:24:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:24:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:24:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:47,367 INFO L87 Difference]: Start difference. First operand 229 states and 275 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-10 15:24:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:47,603 INFO L93 Difference]: Finished difference Result 221 states and 267 transitions. [2024-11-10 15:24:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:24:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2024-11-10 15:24:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:47,605 INFO L225 Difference]: With dead ends: 221 [2024-11-10 15:24:47,605 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 15:24:47,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:47,606 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 38 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:47,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 601 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:24:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 15:24:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-10 15:24:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 177 states have (on average 1.4124293785310735) internal successors, (250), 213 states have internal predecessors, (250), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2024-11-10 15:24:47,610 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 25 [2024-11-10 15:24:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:47,610 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2024-11-10 15:24:47,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-10 15:24:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2024-11-10 15:24:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:24:47,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:47,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:24:47,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:47,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1770354935, now seen corresponding path program 1 times [2024-11-10 15:24:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616483621] [2024-11-10 15:24:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,694 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-10 15:24:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616483621] [2024-11-10 15:24:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616483621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:47,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:47,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:24:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512537975] [2024-11-10 15:24:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:47,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:24:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:47,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:24:47,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:47,696 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:47,819 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2024-11-10 15:24:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:24:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:24:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:47,820 INFO L225 Difference]: With dead ends: 219 [2024-11-10 15:24:47,821 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 15:24:47,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:47,821 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:47,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 722 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 15:24:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2024-11-10 15:24:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 211 states have internal predecessors, (248), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 256 transitions. [2024-11-10 15:24:47,826 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 256 transitions. Word has length 30 [2024-11-10 15:24:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:47,826 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 256 transitions. [2024-11-10 15:24:47,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 256 transitions. [2024-11-10 15:24:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:24:47,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:47,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:47,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:24:47,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1013384270, now seen corresponding path program 1 times [2024-11-10 15:24:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140224229] [2024-11-10 15:24:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,861 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-10 15:24:47,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:47,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140224229] [2024-11-10 15:24:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140224229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:47,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:47,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:47,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815713535] [2024-11-10 15:24:47,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:47,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:47,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:47,863 INFO L87 Difference]: Start difference. First operand 213 states and 256 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:47,876 INFO L93 Difference]: Finished difference Result 229 states and 274 transitions. [2024-11-10 15:24:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-10 15:24:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:47,877 INFO L225 Difference]: With dead ends: 229 [2024-11-10 15:24:47,877 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 15:24:47,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:24:47,878 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:47,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 15:24:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2024-11-10 15:24:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 221 states have internal predecessors, (260), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 268 transitions. [2024-11-10 15:24:47,882 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 268 transitions. Word has length 35 [2024-11-10 15:24:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:47,882 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 268 transitions. [2024-11-10 15:24:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 268 transitions. [2024-11-10 15:24:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:24:47,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:47,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:24:47,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -820809320, now seen corresponding path program 1 times [2024-11-10 15:24:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269442247] [2024-11-10 15:24:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:47,920 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-10 15:24:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269442247] [2024-11-10 15:24:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269442247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385944999] [2024-11-10 15:24:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:47,922 INFO L87 Difference]: Start difference. First operand 223 states and 268 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:47,947 INFO L93 Difference]: Finished difference Result 222 states and 265 transitions. [2024-11-10 15:24:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:24:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:47,948 INFO L225 Difference]: With dead ends: 222 [2024-11-10 15:24:47,948 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 15:24:47,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:24:47,949 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 13 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:47,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 302 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 15:24:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-10 15:24:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 187 states have (on average 1.3796791443850267) internal successors, (258), 220 states have internal predecessors, (258), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 265 transitions. [2024-11-10 15:24:47,954 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 265 transitions. Word has length 36 [2024-11-10 15:24:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:47,955 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 265 transitions. [2024-11-10 15:24:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 265 transitions. [2024-11-10 15:24:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:24:47,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:47,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:47,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:24:47,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:47,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -820946170, now seen corresponding path program 1 times [2024-11-10 15:24:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171574657] [2024-11-10 15:24:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:48,189 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-10 15:24:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171574657] [2024-11-10 15:24:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171574657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:24:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519868072] [2024-11-10 15:24:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:24:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:24:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:24:48,192 INFO L87 Difference]: Start difference. First operand 222 states and 265 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10 15:24:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:48,535 INFO L93 Difference]: Finished difference Result 336 states and 396 transitions. [2024-11-10 15:24:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:24:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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 36 [2024-11-10 15:24:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:48,537 INFO L225 Difference]: With dead ends: 336 [2024-11-10 15:24:48,537 INFO L226 Difference]: Without dead ends: 336 [2024-11-10 15:24:48,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:48,538 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 120 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:48,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1027 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-10 15:24:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 237. [2024-11-10 15:24:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 202 states have (on average 1.3564356435643565) internal successors, (274), 235 states have internal predecessors, (274), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 281 transitions. [2024-11-10 15:24:48,543 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 281 transitions. Word has length 36 [2024-11-10 15:24:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:48,543 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 281 transitions. [2024-11-10 15:24:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10 15:24:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 281 transitions. [2024-11-10 15:24:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:24:48,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:48,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:48,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:24:48,544 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:48,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2021175719, now seen corresponding path program 1 times [2024-11-10 15:24:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755002116] [2024-11-10 15:24:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:48,655 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-10 15:24:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:48,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755002116] [2024-11-10 15:24:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755002116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191160888] [2024-11-10 15:24:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:48,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:48,657 INFO L87 Difference]: Start difference. First operand 237 states and 281 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-10 15:24:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:48,791 INFO L93 Difference]: Finished difference Result 236 states and 280 transitions. [2024-11-10 15:24:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-10 15:24:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:48,793 INFO L225 Difference]: With dead ends: 236 [2024-11-10 15:24:48,793 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 15:24:48,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:48,794 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:48,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 504 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 15:24:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-10 15:24:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 202 states have (on average 1.3514851485148516) internal successors, (273), 234 states have internal predecessors, (273), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 280 transitions. [2024-11-10 15:24:48,798 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 280 transitions. Word has length 37 [2024-11-10 15:24:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:48,798 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 280 transitions. [2024-11-10 15:24:48,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-10 15:24:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 280 transitions. [2024-11-10 15:24:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:24:48,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:48,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:24:48,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2021175720, now seen corresponding path program 1 times [2024-11-10 15:24:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206404324] [2024-11-10 15:24:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:48,965 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-10 15:24:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206404324] [2024-11-10 15:24:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206404324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:24:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493002930] [2024-11-10 15:24:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:24:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:24:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:24:48,967 INFO L87 Difference]: Start difference. First operand 236 states and 280 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-10 15:24:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:49,110 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2024-11-10 15:24:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:24:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-10 15:24:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:49,111 INFO L225 Difference]: With dead ends: 235 [2024-11-10 15:24:49,112 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 15:24:49,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:24:49,112 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:49,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 512 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 15:24:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-10 15:24:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 233 states have internal predecessors, (272), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-10 15:24:49,117 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 37 [2024-11-10 15:24:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:49,117 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-10 15:24:49,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-10 15:24:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-10 15:24:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:24:49,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:49,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:49,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:24:49,118 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash -388580185, now seen corresponding path program 1 times [2024-11-10 15:24:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838043638] [2024-11-10 15:24:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838043638] [2024-11-10 15:24:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838043638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509613680] [2024-11-10 15:24:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:49,345 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-10 15:24:49,348 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-10 15:24:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:49,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 15:24:49,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:49,522 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-10 15:24:49,529 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-10 15:24:49,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:24:49,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:24:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:49,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:50,430 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 10 treesize of output 8 [2024-11-10 15:24:50,436 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 14 treesize of output 12 [2024-11-10 15:24:50,445 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 10 treesize of output 8 [2024-11-10 15:24:50,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:50,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509613680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:50,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:50,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-10 15:24:50,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509489324] [2024-11-10 15:24:50,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:50,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:24:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:24:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:24:50,465 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-10 15:24:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:50,973 INFO L93 Difference]: Finished difference Result 386 states and 443 transitions. [2024-11-10 15:24:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:24:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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 38 [2024-11-10 15:24:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:50,978 INFO L225 Difference]: With dead ends: 386 [2024-11-10 15:24:50,978 INFO L226 Difference]: Without dead ends: 386 [2024-11-10 15:24:50,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:24:50,979 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 664 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:50,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1006 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-10 15:24:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 276. [2024-11-10 15:24:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 243 states have (on average 1.353909465020576) internal successors, (329), 274 states have internal predecessors, (329), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 336 transitions. [2024-11-10 15:24:50,986 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 336 transitions. Word has length 38 [2024-11-10 15:24:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:50,986 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 336 transitions. [2024-11-10 15:24:50,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-10 15:24:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 336 transitions. [2024-11-10 15:24:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:24:50,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:50,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:51,006 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-10 15:24:51,188 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,SelfDestructingSolverStorable21 [2024-11-10 15:24:51,188 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1699465991, now seen corresponding path program 1 times [2024-11-10 15:24:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315711487] [2024-11-10 15:24:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:51,502 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-10 15:24:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315711487] [2024-11-10 15:24:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315711487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:51,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:24:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434850132] [2024-11-10 15:24:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:51,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:24:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:24:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:24:51,504 INFO L87 Difference]: Start difference. First operand 276 states and 336 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-10 15:24:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:51,892 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2024-11-10 15:24:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:24:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 40 [2024-11-10 15:24:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:51,894 INFO L225 Difference]: With dead ends: 276 [2024-11-10 15:24:51,894 INFO L226 Difference]: Without dead ends: 276 [2024-11-10 15:24:51,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:24:51,895 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 79 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:51,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 783 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:24:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-10 15:24:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2024-11-10 15:24:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 243 states have (on average 1.3497942386831276) internal successors, (328), 273 states have internal predecessors, (328), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 335 transitions. [2024-11-10 15:24:51,901 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 335 transitions. Word has length 40 [2024-11-10 15:24:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:51,901 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 335 transitions. [2024-11-10 15:24:51,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-10 15:24:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 335 transitions. [2024-11-10 15:24:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:24:51,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:51,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:24:51,903 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1699465992, now seen corresponding path program 1 times [2024-11-10 15:24:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314158201] [2024-11-10 15:24:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:52,371 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-10 15:24:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314158201] [2024-11-10 15:24:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314158201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:24:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734366164] [2024-11-10 15:24:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:24:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:24:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:24:52,373 INFO L87 Difference]: Start difference. First operand 275 states and 335 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-10 15:24:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:52,851 INFO L93 Difference]: Finished difference Result 275 states and 335 transitions. [2024-11-10 15:24:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:24:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 40 [2024-11-10 15:24:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:52,853 INFO L225 Difference]: With dead ends: 275 [2024-11-10 15:24:52,854 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 15:24:52,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:24:52,855 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 75 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:52,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 891 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 15:24:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2024-11-10 15:24:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 243 states have (on average 1.345679012345679) internal successors, (327), 272 states have internal predecessors, (327), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 334 transitions. [2024-11-10 15:24:52,863 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 334 transitions. Word has length 40 [2024-11-10 15:24:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:52,863 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 334 transitions. [2024-11-10 15:24:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-10 15:24:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 334 transitions. [2024-11-10 15:24:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:24:52,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:52,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:24:52,865 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1080149930, now seen corresponding path program 1 times [2024-11-10 15:24:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493337396] [2024-11-10 15:24:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:52,900 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-10 15:24:52,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493337396] [2024-11-10 15:24:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493337396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:52,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:52,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:24:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055276116] [2024-11-10 15:24:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:52,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:52,902 INFO L87 Difference]: Start difference. First operand 274 states and 334 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:52,913 INFO L93 Difference]: Finished difference Result 275 states and 335 transitions. [2024-11-10 15:24:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:52,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:24:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:52,914 INFO L225 Difference]: With dead ends: 275 [2024-11-10 15:24:52,914 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 15:24:52,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:24:52,915 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:52,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 15:24:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-10 15:24:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 273 states have internal predecessors, (328), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 335 transitions. [2024-11-10 15:24:52,920 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 335 transitions. Word has length 42 [2024-11-10 15:24:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 335 transitions. [2024-11-10 15:24:52,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 335 transitions. [2024-11-10 15:24:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:24:52,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:52,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:52,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:24:52,922 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 747532289, now seen corresponding path program 1 times [2024-11-10 15:24:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963747671] [2024-11-10 15:24:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:53,217 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-10 15:24:53,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963747671] [2024-11-10 15:24:53,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963747671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:53,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:24:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331038911] [2024-11-10 15:24:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:53,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:24:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:24:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:24:53,219 INFO L87 Difference]: Start difference. First operand 275 states and 335 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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-10 15:24:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:53,768 INFO L93 Difference]: Finished difference Result 345 states and 401 transitions. [2024-11-10 15:24:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:24:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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) Word has length 41 [2024-11-10 15:24:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:53,771 INFO L225 Difference]: With dead ends: 345 [2024-11-10 15:24:53,771 INFO L226 Difference]: Without dead ends: 345 [2024-11-10 15:24:53,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:24:53,772 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 419 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:53,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 894 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-10 15:24:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 278. [2024-11-10 15:24:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 276 states have internal predecessors, (328), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 335 transitions. [2024-11-10 15:24:53,777 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 335 transitions. Word has length 41 [2024-11-10 15:24:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:53,777 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 335 transitions. [2024-11-10 15:24:53,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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-10 15:24:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 335 transitions. [2024-11-10 15:24:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:24:53,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:53,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 15:24:53,778 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 747532290, now seen corresponding path program 1 times [2024-11-10 15:24:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048782024] [2024-11-10 15:24:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:54,322 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-10 15:24:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048782024] [2024-11-10 15:24:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048782024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:24:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429054513] [2024-11-10 15:24:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:54,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:24:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:24:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:24:54,325 INFO L87 Difference]: Start difference. First operand 278 states and 335 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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-10 15:24:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:54,873 INFO L93 Difference]: Finished difference Result 344 states and 399 transitions. [2024-11-10 15:24:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:24:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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) Word has length 41 [2024-11-10 15:24:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:54,875 INFO L225 Difference]: With dead ends: 344 [2024-11-10 15:24:54,876 INFO L226 Difference]: Without dead ends: 344 [2024-11-10 15:24:54,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:24:54,878 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 414 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:54,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 886 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-10 15:24:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 277. [2024-11-10 15:24:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 249 states have (on average 1.3012048192771084) internal successors, (324), 275 states have internal predecessors, (324), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2024-11-10 15:24:54,887 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 41 [2024-11-10 15:24:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:54,887 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2024-11-10 15:24:54,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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-10 15:24:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2024-11-10 15:24:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:24:54,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:54,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:24:54,889 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2090052298, now seen corresponding path program 1 times [2024-11-10 15:24:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:54,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516486555] [2024-11-10 15:24:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:55,015 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-10 15:24:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516486555] [2024-11-10 15:24:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516486555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40935796] [2024-11-10 15:24:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:24:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:24:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:55,018 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:55,178 INFO L93 Difference]: Finished difference Result 288 states and 343 transitions. [2024-11-10 15:24:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-10 15:24:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:55,179 INFO L225 Difference]: With dead ends: 288 [2024-11-10 15:24:55,179 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 15:24:55,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:55,180 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:55,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 689 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 15:24:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2024-11-10 15:24:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 273 states have internal predecessors, (322), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 328 transitions. [2024-11-10 15:24:55,185 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 328 transitions. Word has length 44 [2024-11-10 15:24:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:55,185 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 328 transitions. [2024-11-10 15:24:55,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 328 transitions. [2024-11-10 15:24:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:24:55,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:55,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:24:55,187 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:55,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1611323604, now seen corresponding path program 1 times [2024-11-10 15:24:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561168240] [2024-11-10 15:24:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:55,784 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-10 15:24:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561168240] [2024-11-10 15:24:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561168240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 15:24:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659791156] [2024-11-10 15:24:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:24:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:24:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:24:55,787 INFO L87 Difference]: Start difference. First operand 275 states and 328 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:56,456 INFO L93 Difference]: Finished difference Result 357 states and 407 transitions. [2024-11-10 15:24:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:24:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 15:24:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:56,458 INFO L225 Difference]: With dead ends: 357 [2024-11-10 15:24:56,458 INFO L226 Difference]: Without dead ends: 357 [2024-11-10 15:24:56,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:24:56,459 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 578 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:56,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1230 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-10 15:24:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 276. [2024-11-10 15:24:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 249 states have (on average 1.2971887550200802) internal successors, (323), 274 states have internal predecessors, (323), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 329 transitions. [2024-11-10 15:24:56,464 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 329 transitions. Word has length 45 [2024-11-10 15:24:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:56,464 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 329 transitions. [2024-11-10 15:24:56,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 329 transitions. [2024-11-10 15:24:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:24:56,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:56,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 15:24:56,466 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:56,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1611177754, now seen corresponding path program 1 times [2024-11-10 15:24:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408095509] [2024-11-10 15:24:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:56,841 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-10 15:24:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408095509] [2024-11-10 15:24:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408095509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:56,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:56,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:24:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849489982] [2024-11-10 15:24:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:24:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:56,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:24:56,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:24:56,843 INFO L87 Difference]: Start difference. First operand 276 states and 329 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 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-10 15:24:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:57,502 INFO L93 Difference]: Finished difference Result 395 states and 457 transitions. [2024-11-10 15:24:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:24:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 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) Word has length 45 [2024-11-10 15:24:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:57,504 INFO L225 Difference]: With dead ends: 395 [2024-11-10 15:24:57,504 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 15:24:57,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:24:57,505 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 461 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:57,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1192 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:24:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 15:24:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 279. [2024-11-10 15:24:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 277 states have internal predecessors, (326), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 332 transitions. [2024-11-10 15:24:57,524 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 332 transitions. Word has length 45 [2024-11-10 15:24:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:57,524 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 332 transitions. [2024-11-10 15:24:57,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 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-10 15:24:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 332 transitions. [2024-11-10 15:24:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:24:57,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:57,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:57,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:24:57,526 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:57,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 72002229, now seen corresponding path program 1 times [2024-11-10 15:24:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071989929] [2024-11-10 15:24:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071989929] [2024-11-10 15:24:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071989929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:24:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745632440] [2024-11-10 15:24:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:24:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:24:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:24:57,641 INFO L87 Difference]: Start difference. First operand 279 states and 332 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:57,814 INFO L93 Difference]: Finished difference Result 295 states and 348 transitions. [2024-11-10 15:24:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:24:57,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-10 15:24:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:57,815 INFO L225 Difference]: With dead ends: 295 [2024-11-10 15:24:57,816 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 15:24:57,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:57,816 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 18 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:57,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 632 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:24:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 15:24:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2024-11-10 15:24:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 264 states have (on average 1.2803030303030303) internal successors, (338), 289 states have internal predecessors, (338), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2024-11-10 15:24:57,821 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 47 [2024-11-10 15:24:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2024-11-10 15:24:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2024-11-10 15:24:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:24:57,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:57,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:24:57,823 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:57,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash -552119004, now seen corresponding path program 1 times [2024-11-10 15:24:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582857804] [2024-11-10 15:24:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:57,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:57,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582857804] [2024-11-10 15:24:57,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582857804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:57,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:24:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632339237] [2024-11-10 15:24:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:57,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:24:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:24:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:24:57,858 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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-10 15:24:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:57,906 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2024-11-10 15:24:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:24:57,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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) Word has length 46 [2024-11-10 15:24:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:57,908 INFO L225 Difference]: With dead ends: 300 [2024-11-10 15:24:57,908 INFO L226 Difference]: Without dead ends: 300 [2024-11-10 15:24:57,908 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-10 15:24:57,908 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 100 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:57,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 174 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:24:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-10 15:24:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292. [2024-11-10 15:24:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 265 states have (on average 1.2792452830188679) internal successors, (339), 290 states have internal predecessors, (339), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 345 transitions. [2024-11-10 15:24:57,915 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 345 transitions. Word has length 46 [2024-11-10 15:24:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 345 transitions. [2024-11-10 15:24:57,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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-10 15:24:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 345 transitions. [2024-11-10 15:24:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:24:57,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:57,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:57,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 15:24:57,918 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:57,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash -568150955, now seen corresponding path program 1 times [2024-11-10 15:24:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:57,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565478667] [2024-11-10 15:24:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:58,630 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-10 15:24:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565478667] [2024-11-10 15:24:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565478667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:24:58,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:24:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 15:24:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25731198] [2024-11-10 15:24:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:24:58,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:24:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:24:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:24:58,634 INFO L87 Difference]: Start difference. First operand 292 states and 345 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:59,273 INFO L93 Difference]: Finished difference Result 365 states and 419 transitions. [2024-11-10 15:24:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:24:59,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-10 15:24:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:59,275 INFO L225 Difference]: With dead ends: 365 [2024-11-10 15:24:59,275 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 15:24:59,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:24:59,276 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 550 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:59,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1155 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:24:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 15:24:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 293. [2024-11-10 15:24:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 266 states have (on average 1.2781954887218046) internal successors, (340), 291 states have internal predecessors, (340), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 346 transitions. [2024-11-10 15:24:59,283 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 346 transitions. Word has length 49 [2024-11-10 15:24:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:59,283 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 346 transitions. [2024-11-10 15:24:59,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:24:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 346 transitions. [2024-11-10 15:24:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:24:59,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:59,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:59,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 15:24:59,285 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:24:59,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1067353759, now seen corresponding path program 1 times [2024-11-10 15:24:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:59,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304899978] [2024-11-10 15:24:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:24:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304899978] [2024-11-10 15:24:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304899978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677461551] [2024-11-10 15:24:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:59,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:59,472 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-10 15:24:59,475 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-10 15:24:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:59,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 15:24:59,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:59,587 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-10 15:24:59,592 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-10 15:24:59,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 15:24:59,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:24:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:59,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:24:59,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677461551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:59,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:59,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-10 15:24:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267975972] [2024-11-10 15:24:59,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:24:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:24:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:24:59,998 INFO L87 Difference]: Start difference. First operand 293 states and 346 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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-10 15:25:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:25:00,473 INFO L93 Difference]: Finished difference Result 421 states and 481 transitions. [2024-11-10 15:25:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:25:00,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 51 [2024-11-10 15:25:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:25:00,475 INFO L225 Difference]: With dead ends: 421 [2024-11-10 15:25:00,475 INFO L226 Difference]: Without dead ends: 421 [2024-11-10 15:25:00,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:25:00,476 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 163 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:25:00,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1159 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:25:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-10 15:25:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2024-11-10 15:25:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.2852348993288591) internal successors, (383), 323 states have internal predecessors, (383), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 389 transitions. [2024-11-10 15:25:00,484 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 389 transitions. Word has length 51 [2024-11-10 15:25:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:25:00,484 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 389 transitions. [2024-11-10 15:25:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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-10 15:25:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 389 transitions. [2024-11-10 15:25:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:25:00,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:25:00,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:25:00,503 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-10 15:25:00,689 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,SelfDestructingSolverStorable33 [2024-11-10 15:25:00,690 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:25:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:25:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1295631654, now seen corresponding path program 1 times [2024-11-10 15:25:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:25:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204186376] [2024-11-10 15:25:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:25:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:25:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:25:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:25:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:25:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204186376] [2024-11-10 15:25:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204186376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:25:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:25:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:25:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318297988] [2024-11-10 15:25:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:25:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:25:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:25:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:25:00,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:25:00,736 INFO L87 Difference]: Start difference. First operand 325 states and 389 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:25:00,789 INFO L93 Difference]: Finished difference Result 327 states and 388 transitions. [2024-11-10 15:25:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:25:00,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 15:25:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:25:00,790 INFO L225 Difference]: With dead ends: 327 [2024-11-10 15:25:00,790 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 15:25:00,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:25:00,791 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:25:00,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 198 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:25:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 15:25:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2024-11-10 15:25:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 298 states have (on average 1.2751677852348993) internal successors, (380), 322 states have internal predecessors, (380), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2024-11-10 15:25:00,796 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 52 [2024-11-10 15:25:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:25:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2024-11-10 15:25:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:25:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2024-11-10 15:25:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:25:00,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:25:00,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:25:00,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 15:25:00,797 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2024-11-10 15:25:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:25:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash -681061008, now seen corresponding path program 1 times [2024-11-10 15:25:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:25:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541353606] [2024-11-10 15:25:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:25:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:25:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:25:00,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:25:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:25:00,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 15:25:00,876 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:25:00,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 68 remaining) [2024-11-10 15:25:00,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (66 of 68 remaining) [2024-11-10 15:25:00,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (65 of 68 remaining) [2024-11-10 15:25:00,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (64 of 68 remaining) [2024-11-10 15:25:00,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (63 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (62 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (59 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (58 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (57 of 68 remaining) [2024-11-10 15:25:00,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2024-11-10 15:25:00,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2024-11-10 15:25:00,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2024-11-10 15:25:00,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2024-11-10 15:25:00,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2024-11-10 15:25:00,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2024-11-10 15:25:00,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2024-11-10 15:25:00,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2024-11-10 15:25:00,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2024-11-10 15:25:00,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2024-11-10 15:25:00,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2024-11-10 15:25:00,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2024-11-10 15:25:00,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2024-11-10 15:25:00,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2024-11-10 15:25:00,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2024-11-10 15:25:00,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2024-11-10 15:25:00,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2024-11-10 15:25:00,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2024-11-10 15:25:00,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2024-11-10 15:25:00,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 68 remaining) [2024-11-10 15:25:00,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2024-11-10 15:25:00,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2024-11-10 15:25:00,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 68 remaining) [2024-11-10 15:25:00,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 68 remaining) [2024-11-10 15:25:00,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 68 remaining) [2024-11-10 15:25:00,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 68 remaining) [2024-11-10 15:25:00,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 15:25:00,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:25:00,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:25:00,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:25:00 BoogieIcfgContainer [2024-11-10 15:25:00,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:25:00,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:25:00,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:25:00,931 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:25:00,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:42" (3/4) ... [2024-11-10 15:25:00,932 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 15:25:00,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:25:00,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:25:00,981 INFO L158 Benchmark]: Toolchain (without parser) took 20375.12ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 117.9MB in the beginning and 225.4MB in the end (delta: -107.5MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,981 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 172.0MB. Free memory was 137.6MB in the beginning and 137.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.34ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 96.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 172.0MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: Boogie Preprocessor took 86.06ms. Allocated memory is still 172.0MB. Free memory was 94.8MB in the beginning and 91.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: IcfgBuilder took 761.07ms. Allocated memory is still 172.0MB. Free memory was 91.3MB in the beginning and 58.5MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: TraceAbstraction took 18905.39ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 57.7MB in the beginning and 227.5MB in the end (delta: -169.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:25:00,982 INFO L158 Benchmark]: Witness Printer took 49.07ms. Allocated memory is still 339.7MB. Free memory was 227.5MB in the beginning and 225.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:25:00,983 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.34ms. Allocated memory is still 172.0MB. Free memory was 137.6MB in the beginning and 137.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.34ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 96.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 172.0MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.06ms. Allocated memory is still 172.0MB. Free memory was 94.8MB in the beginning and 91.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 761.07ms. Allocated memory is still 172.0MB. Free memory was 91.3MB in the beginning and 58.5MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18905.39ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 57.7MB in the beginning and 227.5MB in the end (delta: -169.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 49.07ms. Allocated memory is still 339.7MB. Free memory was 227.5MB in the beginning and 225.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1036] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1037] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] inner->inner - UnprovableResult [Line: 992]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 220 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 36, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5730 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5730 mSDsluCounter, 21517 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15956 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9647 IncrementalHoareTripleChecker+Invalid, 9868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 5561 mSDtfsCounter, 9647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=34, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 1014 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1213 NumberOfCodeBlocks, 1213 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1212 ConstructedInterpolants, 18 QuantifiedInterpolants, 10985 SizeOfPredicates, 11 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 39 InterpolantComputations, 33 PerfectInterpolantSequences, 16/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 15:25:01,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)