./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:22:23,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:22:23,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-17 00:22:23,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:22:23,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:22:23,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:22:23,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:22:23,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:22:23,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:22:23,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:22:23,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:22:23,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:22:23,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:22:23,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:22:23,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:22:23,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:22:23,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:22:23,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:22:23,227 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:22:23,227 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:22:23,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:22:23,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:22:23,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:22:23,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:22:23,232 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:22:23,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:22:23,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:22:23,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:22:23,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:22:23,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:22:23,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:22:23,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:22:23,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:22:23,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:22:23,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:22:23,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:22:23,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:22:23,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:22:23,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:22:23,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc [2024-11-17 00:22:23,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:22:23,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:22:23,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:22:23,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:22:23,524 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:22:23,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2024-11-17 00:22:24,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:22:25,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:22:25,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2024-11-17 00:22:25,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee0d8279/05f63c42474643c6a985a3672dfc590f/FLAGb51e16435 [2024-11-17 00:22:25,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee0d8279/05f63c42474643c6a985a3672dfc590f [2024-11-17 00:22:25,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:22:25,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:22:25,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:22:25,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:22:25,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:22:25,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a6c6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25, skipping insertion in model container [2024-11-17 00:22:25,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:22:25,634 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:22:25,636 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:22:25,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:22:25,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:22:25,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:22:25,738 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:22:25,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25 WrapperNode [2024-11-17 00:22:25,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:22:25,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:22:25,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:22:25,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:22:25,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,796 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-17 00:22:25,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:22:25,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:22:25,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:22:25,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:22:25,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,834 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-17 00:22:25,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:22:25,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:22:25,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:22:25,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:22:25,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (1/1) ... [2024-11-17 00:22:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:22:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:25,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:22:25,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:22:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:22:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:22:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:22:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:22:26,057 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:22:26,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:22:26,311 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-17 00:22:26,312 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:22:26,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:22:26,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:22:26,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:26 BoogieIcfgContainer [2024-11-17 00:22:26,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:22:26,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:22:26,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:22:26,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:22:26,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:22:25" (1/3) ... [2024-11-17 00:22:26,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5c4dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:26, skipping insertion in model container [2024-11-17 00:22:26,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:25" (2/3) ... [2024-11-17 00:22:26,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5c4dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:26, skipping insertion in model container [2024-11-17 00:22:26,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:26" (3/3) ... [2024-11-17 00:22:26,341 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn_malloc.i [2024-11-17 00:22:26,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:22:26,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-17 00:22:26,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:22:26,408 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;@600a52ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:22:26,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-17 00:22:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:26,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:26,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:26,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1278472676, now seen corresponding path program 1 times [2024-11-17 00:22:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692959782] [2024-11-17 00:22:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692959782] [2024-11-17 00:22:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692959782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:22:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364482397] [2024-11-17 00:22:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:26,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:22:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:22:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:26,920 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:26,999 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-17 00:22:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:22:27,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-17 00:22:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:27,011 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:22:27,011 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 00:22:27,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:27,019 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:27,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 00:22:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-17 00:22:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-17 00:22:27,059 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 6 [2024-11-17 00:22:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:27,059 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-17 00:22:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-17 00:22:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:27,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:27,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:27,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:22:27,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:27,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1278472675, now seen corresponding path program 1 times [2024-11-17 00:22:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606466313] [2024-11-17 00:22:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606466313] [2024-11-17 00:22:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606466313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310574615] [2024-11-17 00:22:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:27,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:27,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:27,348 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:27,376 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-17 00:22:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-17 00:22:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:27,379 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:22:27,380 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 00:22:27,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:27,381 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:27,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 00:22:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-17 00:22:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-17 00:22:27,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 6 [2024-11-17 00:22:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:27,392 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-17 00:22:27,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-17 00:22:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:27,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:27,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:22:27,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1278442884, now seen corresponding path program 1 times [2024-11-17 00:22:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375566164] [2024-11-17 00:22:27,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375566164] [2024-11-17 00:22:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375566164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943671347] [2024-11-17 00:22:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:27,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:27,564 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:27,582 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-17 00:22:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-11-17 00:22:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:27,584 INFO L225 Difference]: With dead ends: 55 [2024-11-17 00:22:27,584 INFO L226 Difference]: Without dead ends: 55 [2024-11-17 00:22:27,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:27,586 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:27,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-17 00:22:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-17 00:22:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-17 00:22:27,591 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 6 [2024-11-17 00:22:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:27,592 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-17 00:22:27,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-17 00:22:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:22:27,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:27,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:22:27,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash -977947262, now seen corresponding path program 1 times [2024-11-17 00:22:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101408613] [2024-11-17 00:22:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101408613] [2024-11-17 00:22:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101408613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:27,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:27,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535182240] [2024-11-17 00:22:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:27,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:27,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:27,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:27,873 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:27,971 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-17 00:22:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:27,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:22:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:27,975 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:22:27,975 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:22:27,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:27,976 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:27,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:22:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-17 00:22:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-17 00:22:27,982 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 7 [2024-11-17 00:22:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:27,982 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-17 00:22:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-17 00:22:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:22:27,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:27,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:22:27,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -977947261, now seen corresponding path program 1 times [2024-11-17 00:22:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900654842] [2024-11-17 00:22:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900654842] [2024-11-17 00:22:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900654842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479791405] [2024-11-17 00:22:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:28,124 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,143 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-11-17 00:22:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:28,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:22:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,146 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:22:28,146 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:22:28,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:28,148 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:22:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:22:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-11-17 00:22:28,158 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 7 [2024-11-17 00:22:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-11-17 00:22:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-11-17 00:22:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:22:28,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:22:28,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -977917470, now seen corresponding path program 1 times [2024-11-17 00:22:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640994112] [2024-11-17 00:22:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640994112] [2024-11-17 00:22:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640994112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692516197] [2024-11-17 00:22:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:28,300 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,353 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-17 00:22:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:28,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:22:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,357 INFO L225 Difference]: With dead ends: 53 [2024-11-17 00:22:28,357 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 00:22:28,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:28,359 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 00:22:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-17 00:22:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-17 00:22:28,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2024-11-17 00:22:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,364 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-17 00:22:28,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-17 00:22:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:22:28,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:22:28,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1263684744, now seen corresponding path program 1 times [2024-11-17 00:22:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222558427] [2024-11-17 00:22:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222558427] [2024-11-17 00:22:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222558427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458136186] [2024-11-17 00:22:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:28,417 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,484 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-17 00:22:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:22:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,485 INFO L225 Difference]: With dead ends: 48 [2024-11-17 00:22:28,485 INFO L226 Difference]: Without dead ends: 48 [2024-11-17 00:22:28,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:28,486 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-17 00:22:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-17 00:22:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-11-17 00:22:28,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 10 [2024-11-17 00:22:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,495 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-11-17 00:22:28,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-17 00:22:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:22:28,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:22:28,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1263684743, now seen corresponding path program 1 times [2024-11-17 00:22:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252006790] [2024-11-17 00:22:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252006790] [2024-11-17 00:22:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252006790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:22:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052866861] [2024-11-17 00:22:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:22:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:22:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:28,614 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,715 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-11-17 00:22:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:22:28,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:22:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,718 INFO L225 Difference]: With dead ends: 68 [2024-11-17 00:22:28,718 INFO L226 Difference]: Without dead ends: 68 [2024-11-17 00:22:28,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:28,721 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 112 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-17 00:22:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2024-11-17 00:22:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-17 00:22:28,726 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 10 [2024-11-17 00:22:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,726 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-17 00:22:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-17 00:22:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:28,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:22:28,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1892901593, now seen corresponding path program 1 times [2024-11-17 00:22:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799894752] [2024-11-17 00:22:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799894752] [2024-11-17 00:22:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799894752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:22:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595382301] [2024-11-17 00:22:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:22:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:22:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:28,794 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-17 00:22:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,807 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-17 00:22:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:22:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-17 00:22:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,809 INFO L225 Difference]: With dead ends: 50 [2024-11-17 00:22:28,810 INFO L226 Difference]: Without dead ends: 50 [2024-11-17 00:22:28,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:28,810 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-17 00:22:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-17 00:22:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-17 00:22:28,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 15 [2024-11-17 00:22:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-17 00:22:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-17 00:22:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-17 00:22:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:28,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:22:28,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1895550011, now seen corresponding path program 1 times [2024-11-17 00:22:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477110842] [2024-11-17 00:22:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477110842] [2024-11-17 00:22:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477110842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:28,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078961189] [2024-11-17 00:22:28,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:28,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:28,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:28,897 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 00:22:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:28,971 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-17 00:22:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 00:22:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:28,972 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:22:28,972 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:22:28,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:28,973 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:28,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:22:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-17 00:22:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-17 00:22:28,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 15 [2024-11-17 00:22:28,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:28,980 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-17 00:22:28,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 00:22:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-17 00:22:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:28,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:28,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:22:28,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1895550012, now seen corresponding path program 1 times [2024-11-17 00:22:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645698738] [2024-11-17 00:22:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645698738] [2024-11-17 00:22:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645698738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:22:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822868583] [2024-11-17 00:22:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:22:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:22:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:29,149 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-17 00:22:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:29,244 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-17 00:22:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-17 00:22:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:29,245 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:22:29,246 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:22:29,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:22:29,247 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 80 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:29,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 137 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:22:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:22:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-17 00:22:29,255 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 15 [2024-11-17 00:22:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:29,255 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-17 00:22:29,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-17 00:22:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-17 00:22:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:22:29,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:29,259 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-17 00:22:29,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:22:29,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1077693942, now seen corresponding path program 1 times [2024-11-17 00:22:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828993688] [2024-11-17 00:22:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828993688] [2024-11-17 00:22:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828993688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:22:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562612560] [2024-11-17 00:22:29,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:22:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:22:29,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:29,288 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-17 00:22:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:29,300 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-17 00:22:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:22:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-17 00:22:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:29,301 INFO L225 Difference]: With dead ends: 53 [2024-11-17 00:22:29,301 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 00:22:29,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:29,302 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:29,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 00:22:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-17 00:22:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.326086956521739) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-17 00:22:29,305 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 19 [2024-11-17 00:22:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:29,305 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-17 00:22:29,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-17 00:22:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-17 00:22:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:22:29,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:29,306 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] [2024-11-17 00:22:29,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:22:29,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -951226190, now seen corresponding path program 1 times [2024-11-17 00:22:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553504958] [2024-11-17 00:22:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553504958] [2024-11-17 00:22:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553504958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496857311] [2024-11-17 00:22:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:29,387 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:29,421 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-17 00:22:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:22:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:29,422 INFO L225 Difference]: With dead ends: 52 [2024-11-17 00:22:29,423 INFO L226 Difference]: Without dead ends: 52 [2024-11-17 00:22:29,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:29,423 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 50 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-17 00:22:29,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-17 00:22:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-17 00:22:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-17 00:22:29,430 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 20 [2024-11-17 00:22:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:29,434 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-17 00:22:29,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-17 00:22:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:22:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:29,435 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:22:29,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1975693319, now seen corresponding path program 1 times [2024-11-17 00:22:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755920510] [2024-11-17 00:22:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755920510] [2024-11-17 00:22:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755920510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027236356] [2024-11-17 00:22:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:22:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:22:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:29,466 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:29,474 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-17 00:22:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:22:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:22:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:29,475 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:22:29,475 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:22:29,476 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-17 00:22:29,476 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:29,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:22:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:22:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-17 00:22:29,480 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 20 [2024-11-17 00:22:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:29,480 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-17 00:22:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-17 00:22:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:22:29,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:29,481 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:22:29,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 238646505, now seen corresponding path program 1 times [2024-11-17 00:22:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916199944] [2024-11-17 00:22:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,648 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-17 00:22:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916199944] [2024-11-17 00:22:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916199944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:22:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078604089] [2024-11-17 00:22:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:22:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:22:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:29,650 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-17 00:22:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:29,719 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-17 00:22:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 22 [2024-11-17 00:22:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:29,720 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:22:29,720 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:22:29,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:22:29,721 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 179 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:22:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-17 00:22:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-11-17 00:22:29,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 22 [2024-11-17 00:22:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:29,724 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-17 00:22:29,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-17 00:22:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-17 00:22:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:22:29,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:29,725 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:29,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:22:29,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -170177720, now seen corresponding path program 1 times [2024-11-17 00:22:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872802334] [2024-11-17 00:22:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872802334] [2024-11-17 00:22:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872802334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:22:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569572268] [2024-11-17 00:22:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:22:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:22:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:22:29,915 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:30,024 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2024-11-17 00:22:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:22:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:22:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:30,025 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:22:30,025 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:22:30,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:22:30,026 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:30,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 230 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:22:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2024-11-17 00:22:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.263157894736842) internal successors, (96), 81 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-17 00:22:30,032 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 22 [2024-11-17 00:22:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:30,032 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-17 00:22:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-17 00:22:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:22:30,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:30,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:30,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:22:30,034 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -145457501, now seen corresponding path program 1 times [2024-11-17 00:22:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865930447] [2024-11-17 00:22:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865930447] [2024-11-17 00:22:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865930447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504574085] [2024-11-17 00:22:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:30,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:30,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:22:30,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:22:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:30,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:22:30,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:30,431 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 14 treesize of output 10 [2024-11-17 00:22:30,739 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:22:30,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-17 00:22:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:30,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:31,256 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 13 treesize of output 11 [2024-11-17 00:22:31,263 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 22 treesize of output 20 [2024-11-17 00:22:31,271 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 5 treesize of output 3 [2024-11-17 00:22:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504574085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:31,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:31,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 24 [2024-11-17 00:22:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678464856] [2024-11-17 00:22:31,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:22:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:22:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:22:31,279 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:32,556 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2024-11-17 00:22:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:22:32,557 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:22:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:32,557 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:22:32,558 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:22:32,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2024-11-17 00:22:32,559 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 263 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:32,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 326 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:22:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:22:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2024-11-17 00:22:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-17 00:22:32,566 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 22 [2024-11-17 00:22:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:32,566 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-17 00:22:32,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-17 00:22:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:22:32,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:32,567 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:32,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:22:32,773 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,SelfDestructingSolverStorable16 [2024-11-17 00:22:32,773 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1014649591, now seen corresponding path program 1 times [2024-11-17 00:22:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508114841] [2024-11-17 00:22:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508114841] [2024-11-17 00:22:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508114841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422820925] [2024-11-17 00:22:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:33,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:33,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:33,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:22:33,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:22:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:33,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 00:22:33,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:33,233 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 14 treesize of output 10 [2024-11-17 00:22:33,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:22:33,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2024-11-17 00:22:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:33,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:33,848 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 21 treesize of output 17 [2024-11-17 00:22:33,859 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 13 treesize of output 11 [2024-11-17 00:22:33,863 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-17 00:22:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422820925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:33,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-17 00:22:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759323151] [2024-11-17 00:22:33,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:22:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:22:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:22:33,905 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:34,613 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2024-11-17 00:22:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:22:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:22:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:34,615 INFO L225 Difference]: With dead ends: 81 [2024-11-17 00:22:34,615 INFO L226 Difference]: Without dead ends: 81 [2024-11-17 00:22:34,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:22:34,616 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 207 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:34,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 312 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:22:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-17 00:22:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2024-11-17 00:22:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-11-17 00:22:34,619 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 22 [2024-11-17 00:22:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-11-17 00:22:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-11-17 00:22:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:22:34,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:34,622 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] [2024-11-17 00:22:34,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:22:34,822 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,SelfDestructingSolverStorable17 [2024-11-17 00:22:34,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:34,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 214767827, now seen corresponding path program 1 times [2024-11-17 00:22:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883550400] [2024-11-17 00:22:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883550400] [2024-11-17 00:22:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883550400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:22:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648525349] [2024-11-17 00:22:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:34,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:22:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:22:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:34,983 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:35,024 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-17 00:22:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:22:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:22:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:35,025 INFO L225 Difference]: With dead ends: 69 [2024-11-17 00:22:35,025 INFO L226 Difference]: Without dead ends: 33 [2024-11-17 00:22:35,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:35,026 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:35,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-17 00:22:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-17 00:22:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-17 00:22:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-17 00:22:35,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2024-11-17 00:22:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:35,027 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-17 00:22:35,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-17 00:22:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:22:35,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:35,029 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:35,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:22:35,029 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:22:35,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1239121028, now seen corresponding path program 2 times [2024-11-17 00:22:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:35,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357833075] [2024-11-17 00:22:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357833075] [2024-11-17 00:22:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357833075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108830198] [2024-11-17 00:22:35,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:22:35,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:35,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:22:35,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:22:35,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:22:35,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:22:35,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-17 00:22:35,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:35,690 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 14 treesize of output 10 [2024-11-17 00:22:36,559 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-17 00:22:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-17 00:22:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:36,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:37,254 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 29 treesize of output 25 [2024-11-17 00:22:37,258 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 21 treesize of output 17 [2024-11-17 00:22:37,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-17 00:22:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108830198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:37,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-17 00:22:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052270142] [2024-11-17 00:22:37,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-17 00:22:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:37,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-17 00:22:37,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1063, Unknown=1, NotChecked=0, Total=1190 [2024-11-17 00:22:37,349 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:43,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:22:47,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:22:51,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:23:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:23:00,737 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-11-17 00:23:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:23:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 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 29 [2024-11-17 00:23:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:23:00,738 INFO L225 Difference]: With dead ends: 73 [2024-11-17 00:23:00,738 INFO L226 Difference]: Without dead ends: 73 [2024-11-17 00:23:00,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=611, Invalid=2924, Unknown=5, NotChecked=0, Total=3540 [2024-11-17 00:23:00,740 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 418 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:23:00,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 209 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 487 Invalid, 4 Unknown, 0 Unchecked, 12.8s Time] [2024-11-17 00:23:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-17 00:23:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2024-11-17 00:23:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:23:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-17 00:23:00,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 29 [2024-11-17 00:23:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:23:00,743 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-17 00:23:00,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:23:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-17 00:23:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:23:00,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:23:00,744 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:23:00,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:23:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:23:00,949 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:23:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:23:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1641617847, now seen corresponding path program 3 times [2024-11-17 00:23:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:23:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569814214] [2024-11-17 00:23:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:23:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:23:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:23:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:23:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:23:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569814214] [2024-11-17 00:23:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569814214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:23:01,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162660815] [2024-11-17 00:23:01,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:23:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:23:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:23:01,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:23:01,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:23:01,958 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 00:23:01,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:23:01,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-17 00:23:01,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:23:01,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:23:02,001 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 14 treesize of output 10 [2024-11-17 00:23:03,899 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-17 00:23:03,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-17 00:23:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 00:23:04,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:23:06,880 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 66 treesize of output 56 [2024-11-17 00:23:06,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:23:06,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-11-17 00:23:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:23:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162660815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:23:07,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:23:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 26] total 52 [2024-11-17 00:23:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6314709] [2024-11-17 00:23:07,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:23:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-17 00:23:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:23:07,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-17 00:23:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2482, Unknown=0, NotChecked=0, Total=2756 [2024-11-17 00:23:07,172 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 53 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 53 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:23:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:23:11,194 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-17 00:23:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 00:23:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 53 states have internal predecessors, (125), 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 50 [2024-11-17 00:23:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:23:11,195 INFO L225 Difference]: With dead ends: 74 [2024-11-17 00:23:11,195 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:23:11,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1014, Invalid=5306, Unknown=0, NotChecked=0, Total=6320 [2024-11-17 00:23:11,198 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 448 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:23:11,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 410 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:23:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:23:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:23:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:23:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:23:11,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-17 00:23:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:23:11,200 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:23:11,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 53 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:23:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:23:11,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:23:11,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-17 00:23:11,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (19 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (18 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (17 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-17 00:23:11,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-17 00:23:11,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-17 00:23:11,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-17 00:23:11,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:23:11,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:23:11,410 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:23:11,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:23:11,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:23:11 BoogieIcfgContainer [2024-11-17 00:23:11,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:23:11,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:23:11,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:23:11,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:23:11,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:26" (3/4) ... [2024-11-17 00:23:11,421 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:23:11,427 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-17 00:23:11,428 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:23:11,428 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-17 00:23:11,428 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:23:11,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:23:11,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:23:11,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:23:11,531 INFO L158 Benchmark]: Toolchain (without parser) took 46285.36ms. Allocated memory was 157.3MB in the beginning and 352.3MB in the end (delta: 195.0MB). Free memory was 101.0MB in the beginning and 155.2MB in the end (delta: -54.3MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,531 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:23:11,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.88ms. Allocated memory is still 157.3MB. Free memory was 100.6MB in the beginning and 80.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.98ms. Allocated memory is still 157.3MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,532 INFO L158 Benchmark]: Boogie Preprocessor took 57.09ms. Allocated memory is still 157.3MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,532 INFO L158 Benchmark]: IcfgBuilder took 474.72ms. Allocated memory is still 157.3MB. Free memory was 75.8MB in the beginning and 58.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,532 INFO L158 Benchmark]: TraceAbstraction took 45085.85ms. Allocated memory was 157.3MB in the beginning and 352.3MB in the end (delta: 195.0MB). Free memory was 58.0MB in the beginning and 161.0MB in the end (delta: -102.9MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,532 INFO L158 Benchmark]: Witness Printer took 110.01ms. Allocated memory is still 352.3MB. Free memory was 161.0MB in the beginning and 155.2MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:23:11,534 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.88ms. Allocated memory is still 157.3MB. Free memory was 100.6MB in the beginning and 80.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.98ms. Allocated memory is still 157.3MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.09ms. Allocated memory is still 157.3MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 474.72ms. Allocated memory is still 157.3MB. Free memory was 75.8MB in the beginning and 58.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45085.85ms. Allocated memory was 157.3MB in the beginning and 352.3MB in the end (delta: 195.0MB). Free memory was 58.0MB in the beginning and 161.0MB in the end (delta: -102.9MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 110.01ms. Allocated memory is still 352.3MB. Free memory was 161.0MB in the beginning and 155.2MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 379]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 1830 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1830 mSDsluCounter, 2954 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2175 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2983 IncrementalHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 779 mSDtfsCounter, 2983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 161 SyntacticMatches, 10 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 21.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=16, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 119 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 570 ConstructedInterpolants, 101 QuantifiedInterpolants, 8647 SizeOfPredicates, 41 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 56/291 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 00:23:11,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE