./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:41:05,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:41:05,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:41:05,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:41:05,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:41:05,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:41:05,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:41:05,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:41:05,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:41:05,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:41:05,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:41:05,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:41:05,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:41:05,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:41:05,284 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:41:05,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:41:05,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:41:05,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:41:05,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:41:05,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:41:05,286 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:41:05,286 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:41:05,286 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:41:05,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:41:05,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:41:05,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:41:05,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:41:05,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:41:05,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:41:05,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:41:05,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:41:05,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:41:05,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:41:05,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:41:05,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:41:05,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:41:05,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:41:05,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2024-11-17 00:41:05,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:41:05,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:41:05,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:41:05,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:41:05,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:41:05,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-17 00:41:06,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:41:07,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:41:07,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-17 00:41:07,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe3889ce/f31363cb819c455888894130a9c58689/FLAG4fcaf8951 [2024-11-17 00:41:07,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe3889ce/f31363cb819c455888894130a9c58689 [2024-11-17 00:41:07,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:41:07,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:41:07,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:41:07,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:41:07,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:41:07,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b781af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07, skipping insertion in model container [2024-11-17 00:41:07,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:41:07,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:41:07,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:41:07,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:41:07,824 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:41:07,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07 WrapperNode [2024-11-17 00:41:07,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:41:07,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:41:07,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:41:07,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:41:07,830 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:41:07" (1/1) ... [2024-11-17 00:41:07,842 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:41:07" (1/1) ... [2024-11-17 00:41:07,885 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2024-11-17 00:41:07,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:41:07,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:41:07,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:41:07,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:41:07,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,942 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2024-11-17 00:41:07,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:41:07,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:41:07,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:41:07,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:41:07,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (1/1) ... [2024-11-17 00:41:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:41:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:07,992 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:41:08,003 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:41:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:41:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:41:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:41:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:41:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:41:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:41:08,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:41:08,191 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:41:08,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:41:08,480 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-17 00:41:08,480 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:41:08,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:41:08,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:41:08,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:41:08 BoogieIcfgContainer [2024-11-17 00:41:08,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:41:08,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:41:08,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:41:08,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:41:08,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:41:07" (1/3) ... [2024-11-17 00:41:08,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d566af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:41:08, skipping insertion in model container [2024-11-17 00:41:08,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:41:07" (2/3) ... [2024-11-17 00:41:08,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d566af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:41:08, skipping insertion in model container [2024-11-17 00:41:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:41:08" (3/3) ... [2024-11-17 00:41:08,502 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2024-11-17 00:41:08,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:41:08,516 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-17 00:41:08,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:41:08,559 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;@7deaad78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:41:08,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-17 00:41:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 89 states have (on average 2.0112359550561796) internal successors, (179), 161 states have internal predecessors, (179), 0 states have call successors, (0), 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:41:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:41:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:08,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:41:08,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 210483, now seen corresponding path program 1 times [2024-11-17 00:41:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002595573] [2024-11-17 00:41:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002595573] [2024-11-17 00:41:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002595573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:08,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:08,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:41:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137062517] [2024-11-17 00:41:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:41:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:41:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:41:08,820 INFO L87 Difference]: Start difference. First operand has 162 states, 89 states have (on average 2.0112359550561796) internal successors, (179), 161 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:08,979 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2024-11-17 00:41:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:41:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:41:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:08,989 INFO L225 Difference]: With dead ends: 156 [2024-11-17 00:41:08,990 INFO L226 Difference]: Without dead ends: 153 [2024-11-17 00:41:08,991 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:41:08,993 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:08,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 97 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-17 00:41:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-17 00:41:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 89 states have (on average 1.8314606741573034) internal successors, (163), 150 states have internal predecessors, (163), 0 states have call successors, (0), 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:41:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-17 00:41:09,024 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 3 [2024-11-17 00:41:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:09,025 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-17 00:41:09,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-17 00:41:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:41:09,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:09,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:41:09,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:41:09,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:09,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 210484, now seen corresponding path program 1 times [2024-11-17 00:41:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:09,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770482500] [2024-11-17 00:41:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:09,102 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:41:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770482500] [2024-11-17 00:41:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770482500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:09,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:41:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28035093] [2024-11-17 00:41:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:09,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:41:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:41:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:41:09,105 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:09,219 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2024-11-17 00:41:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:41:09,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:41:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:09,220 INFO L225 Difference]: With dead ends: 142 [2024-11-17 00:41:09,222 INFO L226 Difference]: Without dead ends: 142 [2024-11-17 00:41:09,223 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:41:09,224 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 112 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:09,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 110 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-17 00:41:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-17 00:41:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.7303370786516854) internal successors, (154), 141 states have internal predecessors, (154), 0 states have call successors, (0), 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:41:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2024-11-17 00:41:09,236 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 3 [2024-11-17 00:41:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:09,238 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2024-11-17 00:41:09,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2024-11-17 00:41:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:41:09,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:09,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:09,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:41:09,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:09,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 884918985, now seen corresponding path program 1 times [2024-11-17 00:41:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629674330] [2024-11-17 00:41:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:09,407 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:41:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629674330] [2024-11-17 00:41:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629674330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585817285] [2024-11-17 00:41:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:09,410 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:09,569 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2024-11-17 00:41:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:41:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:09,570 INFO L225 Difference]: With dead ends: 185 [2024-11-17 00:41:09,571 INFO L226 Difference]: Without dead ends: 185 [2024-11-17 00:41:09,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:09,572 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:09,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 353 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-17 00:41:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 141. [2024-11-17 00:41:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 89 states have (on average 1.7191011235955056) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 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:41:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2024-11-17 00:41:09,578 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 12 [2024-11-17 00:41:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:09,578 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2024-11-17 00:41:09,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2024-11-17 00:41:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:41:09,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:09,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:09,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:41:09,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:09,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 884918986, now seen corresponding path program 1 times [2024-11-17 00:41:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778250603] [2024-11-17 00:41:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:09,802 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:41:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778250603] [2024-11-17 00:41:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778250603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515336049] [2024-11-17 00:41:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:09,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:09,804 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:09,955 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2024-11-17 00:41:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:41:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:09,957 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:41:09,957 INFO L226 Difference]: Without dead ends: 140 [2024-11-17 00:41:09,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:09,959 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:09,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-17 00:41:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-17 00:41:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 89 states have (on average 1.7078651685393258) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 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:41:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2024-11-17 00:41:09,966 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 12 [2024-11-17 00:41:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2024-11-17 00:41:09,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2024-11-17 00:41:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:41:09,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:09,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:09,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:41:09,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:09,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1738652801, now seen corresponding path program 1 times [2024-11-17 00:41:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257220061] [2024-11-17 00:41:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:10,059 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:41:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257220061] [2024-11-17 00:41:10,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257220061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:10,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:10,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:41:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602907265] [2024-11-17 00:41:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:41:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:10,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:41:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:10,062 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:10,196 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-11-17 00:41:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:41:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:10,197 INFO L225 Difference]: With dead ends: 138 [2024-11-17 00:41:10,198 INFO L226 Difference]: Without dead ends: 138 [2024-11-17 00:41:10,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:41:10,199 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 166 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:10,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 86 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-17 00:41:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-11-17 00:41:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 134 states have internal predecessors, (152), 0 states have call successors, (0), 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:41:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-11-17 00:41:10,210 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 13 [2024-11-17 00:41:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:10,211 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-11-17 00:41:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-11-17 00:41:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:41:10,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:10,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:41:10,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1738652800, now seen corresponding path program 1 times [2024-11-17 00:41:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675163471] [2024-11-17 00:41:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:10,429 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:41:10,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:10,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675163471] [2024-11-17 00:41:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675163471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:41:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144719427] [2024-11-17 00:41:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:10,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:41:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:41:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:10,430 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:10,630 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2024-11-17 00:41:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:41:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:41:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:10,631 INFO L225 Difference]: With dead ends: 178 [2024-11-17 00:41:10,631 INFO L226 Difference]: Without dead ends: 178 [2024-11-17 00:41:10,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:41:10,632 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 320 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:10,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 175 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-17 00:41:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2024-11-17 00:41:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.4923076923076923) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 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:41:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-17 00:41:10,637 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 13 [2024-11-17 00:41:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-17 00:41:10,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-17 00:41:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:41:10,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:10,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:10,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:41:10,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1100096357, now seen corresponding path program 1 times [2024-11-17 00:41:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993935581] [2024-11-17 00:41:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:10,742 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:41:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993935581] [2024-11-17 00:41:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993935581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444340166] [2024-11-17 00:41:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:10,744 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:10,867 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2024-11-17 00:41:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:10,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:41:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:10,868 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:41:10,868 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 00:41:10,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:10,869 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:10,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 327 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 00:41:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-17 00:41:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.476923076923077) internal successors, (192), 165 states have internal predecessors, (192), 0 states have call successors, (0), 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:41:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2024-11-17 00:41:10,873 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 16 [2024-11-17 00:41:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:10,873 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2024-11-17 00:41:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2024-11-17 00:41:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:41:10,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:10,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:41:10,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:10,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1100096356, now seen corresponding path program 1 times [2024-11-17 00:41:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568052338] [2024-11-17 00:41:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:10,964 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:41:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568052338] [2024-11-17 00:41:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568052338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:10,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131822646] [2024-11-17 00:41:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:10,966 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:11,082 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2024-11-17 00:41:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:41:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:11,083 INFO L225 Difference]: With dead ends: 165 [2024-11-17 00:41:11,083 INFO L226 Difference]: Without dead ends: 165 [2024-11-17 00:41:11,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:11,083 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:11,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 330 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-17 00:41:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-17 00:41:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 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:41:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2024-11-17 00:41:11,087 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 16 [2024-11-17 00:41:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:11,087 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2024-11-17 00:41:11,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2024-11-17 00:41:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:41:11,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:11,088 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:41:11,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:41:11,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 460744030, now seen corresponding path program 1 times [2024-11-17 00:41:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367802718] [2024-11-17 00:41:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367802718] [2024-11-17 00:41:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367802718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086757668] [2024-11-17 00:41:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:41:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:11,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:41:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:41:11,268 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:41:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:11,523 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2024-11-17 00:41:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:41:11,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:41:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:11,524 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:41:11,524 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 00:41:11,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:41:11,524 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 162 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:11,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 283 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 00:41:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-17 00:41:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 163 states have internal predecessors, (189), 0 states have call successors, (0), 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:41:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2024-11-17 00:41:11,527 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 20 [2024-11-17 00:41:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2024-11-17 00:41:11,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:41:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2024-11-17 00:41:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:41:11,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:11,528 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:41:11,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:41:11,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:11,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 460744031, now seen corresponding path program 1 times [2024-11-17 00:41:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001999108] [2024-11-17 00:41:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:11,732 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:41:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001999108] [2024-11-17 00:41:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001999108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:11,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:11,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:41:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291825914] [2024-11-17 00:41:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:11,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:41:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:41:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:41:11,735 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:41:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:12,120 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2024-11-17 00:41:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:41:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:41:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:12,121 INFO L225 Difference]: With dead ends: 156 [2024-11-17 00:41:12,122 INFO L226 Difference]: Without dead ends: 156 [2024-11-17 00:41:12,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:41:12,122 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 175 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:12,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 388 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:41:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-17 00:41:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 145. [2024-11-17 00:41:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 144 states have internal predecessors, (169), 0 states have call successors, (0), 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:41:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2024-11-17 00:41:12,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 20 [2024-11-17 00:41:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:12,125 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2024-11-17 00:41:12,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:41:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2024-11-17 00:41:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:41:12,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:12,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:12,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:41:12,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 896469007, now seen corresponding path program 1 times [2024-11-17 00:41:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121702546] [2024-11-17 00:41:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:12,150 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:41:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121702546] [2024-11-17 00:41:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121702546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:12,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431318690] [2024-11-17 00:41:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:12,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:41:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:41:12,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:12,151 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:12,229 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2024-11-17 00:41:12,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:12,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:41:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:12,230 INFO L225 Difference]: With dead ends: 167 [2024-11-17 00:41:12,230 INFO L226 Difference]: Without dead ends: 167 [2024-11-17 00:41:12,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:12,231 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 163 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:12,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 171 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-17 00:41:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2024-11-17 00:41:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 144 states have internal predecessors, (167), 0 states have call successors, (0), 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:41:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2024-11-17 00:41:12,234 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 21 [2024-11-17 00:41:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:12,234 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2024-11-17 00:41:12,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2024-11-17 00:41:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:41:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:12,234 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:41:12,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:41:12,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1555137863, now seen corresponding path program 1 times [2024-11-17 00:41:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89747892] [2024-11-17 00:41:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:12,262 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:41:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89747892] [2024-11-17 00:41:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89747892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477656527] [2024-11-17 00:41:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:41:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:41:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:12,263 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:12,275 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2024-11-17 00:41:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:41:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:12,276 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:41:12,276 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:41:12,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:12,277 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:12,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:41:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:41:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-11-17 00:41:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 148 states have internal predecessors, (171), 0 states have call successors, (0), 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:41:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2024-11-17 00:41:12,283 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 23 [2024-11-17 00:41:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2024-11-17 00:41:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2024-11-17 00:41:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:41:12,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:12,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:41:12,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -988451707, now seen corresponding path program 1 times [2024-11-17 00:41:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100772695] [2024-11-17 00:41:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:12,449 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:41:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100772695] [2024-11-17 00:41:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100772695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:12,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:12,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:41:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074130527] [2024-11-17 00:41:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:41:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:41:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:41:12,452 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:12,710 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2024-11-17 00:41:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:41:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:41:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:12,712 INFO L225 Difference]: With dead ends: 236 [2024-11-17 00:41:12,712 INFO L226 Difference]: Without dead ends: 236 [2024-11-17 00:41:12,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:41:12,713 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 184 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:12,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 445 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-17 00:41:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 165. [2024-11-17 00:41:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 164 states have internal predecessors, (191), 0 states have call successors, (0), 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:41:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2024-11-17 00:41:12,718 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 25 [2024-11-17 00:41:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:12,719 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2024-11-17 00:41:12,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2024-11-17 00:41:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:41:12,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:12,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:41:12,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -988451706, now seen corresponding path program 1 times [2024-11-17 00:41:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626565250] [2024-11-17 00:41:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:12,889 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:41:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626565250] [2024-11-17 00:41:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626565250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936426479] [2024-11-17 00:41:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:41:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:41:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:41:12,891 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:13,139 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2024-11-17 00:41:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:41:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:41:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:13,140 INFO L225 Difference]: With dead ends: 232 [2024-11-17 00:41:13,140 INFO L226 Difference]: Without dead ends: 232 [2024-11-17 00:41:13,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:41:13,141 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 179 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:13,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 472 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-17 00:41:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 161. [2024-11-17 00:41:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 160 states have internal predecessors, (185), 0 states have call successors, (0), 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:41:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 185 transitions. [2024-11-17 00:41:13,144 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 185 transitions. Word has length 25 [2024-11-17 00:41:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:13,144 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 185 transitions. [2024-11-17 00:41:13,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 185 transitions. [2024-11-17 00:41:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:41:13,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:13,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:13,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:41:13,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -676233112, now seen corresponding path program 1 times [2024-11-17 00:41:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442504443] [2024-11-17 00:41:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:13,177 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:41:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442504443] [2024-11-17 00:41:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442504443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:13,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:41:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868762222] [2024-11-17 00:41:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:41:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:41:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:41:13,183 INFO L87 Difference]: Start difference. First operand 161 states and 185 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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:41:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:13,193 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2024-11-17 00:41:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:41:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:41:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:13,195 INFO L225 Difference]: With dead ends: 163 [2024-11-17 00:41:13,198 INFO L226 Difference]: Without dead ends: 163 [2024-11-17 00:41:13,198 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:41:13,199 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:13,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:41:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-17 00:41:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-17 00:41:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 140 states have (on average 1.3357142857142856) internal successors, (187), 162 states have internal predecessors, (187), 0 states have call successors, (0), 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:41:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2024-11-17 00:41:13,201 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 26 [2024-11-17 00:41:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:13,202 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2024-11-17 00:41:13,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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:41:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2024-11-17 00:41:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:41:13,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:13,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:13,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:41:13,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1288465400, now seen corresponding path program 1 times [2024-11-17 00:41:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:13,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512883888] [2024-11-17 00:41:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:13,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:41:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512883888] [2024-11-17 00:41:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512883888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:41:13,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415320077] [2024-11-17 00:41:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:13,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:41:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:41:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:41:13,386 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:13,698 INFO L93 Difference]: Finished difference Result 231 states and 261 transitions. [2024-11-17 00:41:13,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:41:13,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-17 00:41:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:13,699 INFO L225 Difference]: With dead ends: 231 [2024-11-17 00:41:13,699 INFO L226 Difference]: Without dead ends: 231 [2024-11-17 00:41:13,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:41:13,700 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 216 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:13,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 421 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-17 00:41:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 169. [2024-11-17 00:41:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 168 states have internal predecessors, (194), 0 states have call successors, (0), 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:41:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2024-11-17 00:41:13,702 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 28 [2024-11-17 00:41:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2024-11-17 00:41:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2024-11-17 00:41:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:41:13,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:13,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:41:13,704 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 664441577, now seen corresponding path program 1 times [2024-11-17 00:41:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899666596] [2024-11-17 00:41:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:13,774 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:41:13,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899666596] [2024-11-17 00:41:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899666596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:13,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:13,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098608742] [2024-11-17 00:41:13,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:13,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:13,776 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:13,885 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2024-11-17 00:41:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-17 00:41:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:13,886 INFO L225 Difference]: With dead ends: 177 [2024-11-17 00:41:13,886 INFO L226 Difference]: Without dead ends: 177 [2024-11-17 00:41:13,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:13,887 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:13,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-17 00:41:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2024-11-17 00:41:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 146 states have (on average 1.321917808219178) internal successors, (193), 167 states have internal predecessors, (193), 0 states have call successors, (0), 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:41:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2024-11-17 00:41:13,889 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 28 [2024-11-17 00:41:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2024-11-17 00:41:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2024-11-17 00:41:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:41:13,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:13,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:13,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:41:13,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:13,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash 664441578, now seen corresponding path program 1 times [2024-11-17 00:41:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486293042] [2024-11-17 00:41:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:14,020 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:41:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486293042] [2024-11-17 00:41:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486293042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:14,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:14,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643640912] [2024-11-17 00:41:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:14,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:41:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:41:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:14,022 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:14,123 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2024-11-17 00:41:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-17 00:41:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:14,124 INFO L225 Difference]: With dead ends: 167 [2024-11-17 00:41:14,124 INFO L226 Difference]: Without dead ends: 167 [2024-11-17 00:41:14,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:41:14,125 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:14,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-17 00:41:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-17 00:41:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 166 states have internal predecessors, (192), 0 states have call successors, (0), 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:41:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2024-11-17 00:41:14,127 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 28 [2024-11-17 00:41:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2024-11-17 00:41:14,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2024-11-17 00:41:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:41:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:14,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:14,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:41:14,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -952721818, now seen corresponding path program 1 times [2024-11-17 00:41:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373528963] [2024-11-17 00:41:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:14,250 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:41:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373528963] [2024-11-17 00:41:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373528963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266284311] [2024-11-17 00:41:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:14,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:41:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:41:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:41:14,252 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:14,573 INFO L93 Difference]: Finished difference Result 300 states and 338 transitions. [2024-11-17 00:41:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:41:14,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:14,574 INFO L225 Difference]: With dead ends: 300 [2024-11-17 00:41:14,574 INFO L226 Difference]: Without dead ends: 300 [2024-11-17 00:41:14,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:41:14,575 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 336 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:14,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 474 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-17 00:41:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 182. [2024-11-17 00:41:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.31055900621118) internal successors, (211), 181 states have internal predecessors, (211), 0 states have call successors, (0), 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:41:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2024-11-17 00:41:14,577 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 29 [2024-11-17 00:41:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:14,578 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2024-11-17 00:41:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2024-11-17 00:41:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:41:14,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:14,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:14,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:41:14,578 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -952721817, now seen corresponding path program 1 times [2024-11-17 00:41:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280692746] [2024-11-17 00:41:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:14,898 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:41:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280692746] [2024-11-17 00:41:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280692746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:41:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182044902] [2024-11-17 00:41:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:41:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:41:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:41:14,900 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:15,490 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2024-11-17 00:41:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:41:15,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:15,491 INFO L225 Difference]: With dead ends: 252 [2024-11-17 00:41:15,491 INFO L226 Difference]: Without dead ends: 252 [2024-11-17 00:41:15,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:41:15,492 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 195 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:15,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 576 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:41:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-17 00:41:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 182. [2024-11-17 00:41:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 181 states have internal predecessors, (210), 0 states have call successors, (0), 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:41:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2024-11-17 00:41:15,495 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 29 [2024-11-17 00:41:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2024-11-17 00:41:15,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2024-11-17 00:41:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:41:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:15,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:41:15,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1920144708, now seen corresponding path program 1 times [2024-11-17 00:41:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240606886] [2024-11-17 00:41:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240606886] [2024-11-17 00:41:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240606886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:41:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542519011] [2024-11-17 00:41:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:15,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:41:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:41:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:15,525 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:41:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:15,536 INFO L93 Difference]: Finished difference Result 186 states and 213 transitions. [2024-11-17 00:41:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:41:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-17 00:41:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:15,537 INFO L225 Difference]: With dead ends: 186 [2024-11-17 00:41:15,537 INFO L226 Difference]: Without dead ends: 186 [2024-11-17 00:41:15,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:15,538 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:15,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:41:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-17 00:41:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-17 00:41:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.290909090909091) internal successors, (213), 185 states have internal predecessors, (213), 0 states have call successors, (0), 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:41:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2024-11-17 00:41:15,542 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 31 [2024-11-17 00:41:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:15,542 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2024-11-17 00:41:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:41:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2024-11-17 00:41:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:41:15,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:15,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:15,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:41:15,543 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2011231609, now seen corresponding path program 1 times [2024-11-17 00:41:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:15,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414257110] [2024-11-17 00:41:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:15,726 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:41:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414257110] [2024-11-17 00:41:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414257110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:41:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72341005] [2024-11-17 00:41:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:15,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:41:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:41:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:41:15,729 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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:41:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:16,117 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-17 00:41:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:41:16,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-17 00:41:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:16,119 INFO L225 Difference]: With dead ends: 260 [2024-11-17 00:41:16,119 INFO L226 Difference]: Without dead ends: 260 [2024-11-17 00:41:16,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:41:16,119 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 262 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:16,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 738 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:41:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-17 00:41:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 186. [2024-11-17 00:41:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.284848484848485) internal successors, (212), 185 states have internal predecessors, (212), 0 states have call successors, (0), 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:41:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2024-11-17 00:41:16,122 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 32 [2024-11-17 00:41:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:16,122 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2024-11-17 00:41:16,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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:41:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2024-11-17 00:41:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:41:16,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:16,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:16,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:41:16,123 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:16,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash 275127068, now seen corresponding path program 1 times [2024-11-17 00:41:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:16,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620326357] [2024-11-17 00:41:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:16,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620326357] [2024-11-17 00:41:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620326357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:16,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768993060] [2024-11-17 00:41:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:16,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:16,324 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:41:16,328 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:41:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:16,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:41:16,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:16,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:16,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:16,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:16,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 00:41:16,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 00:41:16,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:16,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 00:41:16,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 00:41:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:16,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:17,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-17 00:41:17,353 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:41:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-17 00:41:17,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:41:17,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768993060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:41:17,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:41:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2024-11-17 00:41:17,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256524419] [2024-11-17 00:41:17,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:41:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:41:17,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:41:17,372 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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:41:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:17,788 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2024-11-17 00:41:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:41:17,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 33 [2024-11-17 00:41:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:17,789 INFO L225 Difference]: With dead ends: 245 [2024-11-17 00:41:17,789 INFO L226 Difference]: Without dead ends: 245 [2024-11-17 00:41:17,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:41:17,790 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 443 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:17,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 589 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-17 00:41:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 200. [2024-11-17 00:41:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.2737430167597765) internal successors, (228), 199 states have internal predecessors, (228), 0 states have call successors, (0), 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:41:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 228 transitions. [2024-11-17 00:41:17,792 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 228 transitions. Word has length 33 [2024-11-17 00:41:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 228 transitions. [2024-11-17 00:41:17,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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:41:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 228 transitions. [2024-11-17 00:41:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:41:17,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:17,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:17,808 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:41:17,993 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,SelfDestructingSolverStorable22 [2024-11-17 00:41:17,993 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -237218231, now seen corresponding path program 1 times [2024-11-17 00:41:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232060759] [2024-11-17 00:41:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:18,089 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:41:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232060759] [2024-11-17 00:41:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232060759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823753022] [2024-11-17 00:41:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:41:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:41:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:41:18,091 INFO L87 Difference]: Start difference. First operand 200 states and 228 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:41:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:18,283 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2024-11-17 00:41:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:41:18,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-17 00:41:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:18,284 INFO L225 Difference]: With dead ends: 236 [2024-11-17 00:41:18,284 INFO L226 Difference]: Without dead ends: 236 [2024-11-17 00:41:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:41:18,285 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 10 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:18,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 572 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-17 00:41:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2024-11-17 00:41:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2702702702702702) internal successors, (235), 205 states have internal predecessors, (235), 0 states have call successors, (0), 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:41:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 235 transitions. [2024-11-17 00:41:18,288 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 235 transitions. Word has length 34 [2024-11-17 00:41:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:18,288 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 235 transitions. [2024-11-17 00:41:18,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:41:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 235 transitions. [2024-11-17 00:41:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:41:18,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:18,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:41:18,289 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1041148860, now seen corresponding path program 1 times [2024-11-17 00:41:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114445393] [2024-11-17 00:41:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:18,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:41:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114445393] [2024-11-17 00:41:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114445393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 00:41:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205220665] [2024-11-17 00:41:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:41:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:41:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:41:18,790 INFO L87 Difference]: Start difference. First operand 206 states and 235 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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:41:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:19,527 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2024-11-17 00:41:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:41:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 00:41:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:19,528 INFO L225 Difference]: With dead ends: 235 [2024-11-17 00:41:19,528 INFO L226 Difference]: Without dead ends: 235 [2024-11-17 00:41:19,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:41:19,529 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 269 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:19,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 720 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:41:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-17 00:41:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2024-11-17 00:41:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 202 states have internal predecessors, (230), 0 states have call successors, (0), 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:41:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 230 transitions. [2024-11-17 00:41:19,532 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 230 transitions. Word has length 37 [2024-11-17 00:41:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:19,532 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 230 transitions. [2024-11-17 00:41:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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:41:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 230 transitions. [2024-11-17 00:41:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:41:19,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:19,532 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:19,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:41:19,533 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash 91484548, now seen corresponding path program 1 times [2024-11-17 00:41:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:19,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651170248] [2024-11-17 00:41:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:19,664 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:41:19,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:19,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651170248] [2024-11-17 00:41:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651170248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:41:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784324644] [2024-11-17 00:41:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:19,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:41:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:41:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:41:19,666 INFO L87 Difference]: Start difference. First operand 203 states and 230 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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:41:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:19,818 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2024-11-17 00:41:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:41:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-17 00:41:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:19,819 INFO L225 Difference]: With dead ends: 243 [2024-11-17 00:41:19,819 INFO L226 Difference]: Without dead ends: 243 [2024-11-17 00:41:19,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:41:19,820 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 128 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:19,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 396 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-17 00:41:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2024-11-17 00:41:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 201 states have (on average 1.243781094527363) internal successors, (250), 221 states have internal predecessors, (250), 0 states have call successors, (0), 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:41:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 250 transitions. [2024-11-17 00:41:19,823 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 250 transitions. Word has length 40 [2024-11-17 00:41:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:19,823 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 250 transitions. [2024-11-17 00:41:19,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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:41:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 250 transitions. [2024-11-17 00:41:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:41:19,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:19,824 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:41:19,824 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 91485221, now seen corresponding path program 1 times [2024-11-17 00:41:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:19,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347734236] [2024-11-17 00:41:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:19,886 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:41:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347734236] [2024-11-17 00:41:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347734236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:41:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418422149] [2024-11-17 00:41:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:19,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:41:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:41:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:41:19,888 INFO L87 Difference]: Start difference. First operand 222 states and 250 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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:41:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:20,042 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2024-11-17 00:41:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:41:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-17 00:41:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:20,043 INFO L225 Difference]: With dead ends: 238 [2024-11-17 00:41:20,044 INFO L226 Difference]: Without dead ends: 238 [2024-11-17 00:41:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:41:20,044 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 122 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:20,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 154 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:41:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-17 00:41:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2024-11-17 00:41:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 223 states have internal predecessors, (252), 0 states have call successors, (0), 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:41:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2024-11-17 00:41:20,047 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 40 [2024-11-17 00:41:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:20,047 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2024-11-17 00:41:20,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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:41:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2024-11-17 00:41:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:41:20,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:20,048 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:20,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 00:41:20,048 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:20,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash 772207097, now seen corresponding path program 1 times [2024-11-17 00:41:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991675082] [2024-11-17 00:41:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:20,482 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:41:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991675082] [2024-11-17 00:41:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991675082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612412368] [2024-11-17 00:41:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:20,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:20,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:20,488 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:41:20,489 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:41:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:20,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-17 00:41:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:20,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:41:20,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:20,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:20,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:41:20,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:41:20,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:20,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:20,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:21,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:41:21,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2024-11-17 00:41:21,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-17 00:41:21,189 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:41:21,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:41:21,203 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:41:21,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:41:21,307 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:41:21,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:41:21,331 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:41:21,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:41:21,408 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:41:21,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-17 00:41:21,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-17 00:41:21,542 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 7 treesize of output 3 [2024-11-17 00:41:21,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:21,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:21,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:21,595 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:41:21,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:21,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_983 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2024-11-17 00:41:21,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_976) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_983) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_977))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_982)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2024-11-17 00:41:21,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_977))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_982)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_ArrVal_975 Int) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_975)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_976) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_983) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-17 00:41:25,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:25,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:25,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2024-11-17 00:41:25,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:25,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:25,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2024-11-17 00:41:25,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:25,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 49 [2024-11-17 00:41:25,853 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 114 treesize of output 96 [2024-11-17 00:41:25,864 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 28 treesize of output 24 [2024-11-17 00:41:25,875 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 12 treesize of output 8 [2024-11-17 00:41:25,877 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 11 treesize of output 7 [2024-11-17 00:41:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:25,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:25,902 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-17 00:41:25,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-17 00:41:25,936 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:41:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612412368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:41:25,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:41:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 40 [2024-11-17 00:41:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845635724] [2024-11-17 00:41:25,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:25,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-17 00:41:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-17 00:41:25,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1136, Unknown=58, NotChecked=216, Total=1560 [2024-11-17 00:41:25,939 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 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:41:30,041 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:41:34,063 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:41:38,129 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:41:39,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_983 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_983) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) is different from false [2024-11-17 00:41:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:41,081 INFO L93 Difference]: Finished difference Result 551 states and 614 transitions. [2024-11-17 00:41:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-17 00:41:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-17 00:41:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:41,083 INFO L225 Difference]: With dead ends: 551 [2024-11-17 00:41:41,083 INFO L226 Difference]: Without dead ends: 551 [2024-11-17 00:41:41,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=821, Invalid=4377, Unknown=74, NotChecked=580, Total=5852 [2024-11-17 00:41:41,085 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 793 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 128 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 3982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 1544 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:41,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1889 Invalid, 3982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2270 Invalid, 40 Unknown, 1544 Unchecked, 13.7s Time] [2024-11-17 00:41:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-17 00:41:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 267. [2024-11-17 00:41:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 246 states have (on average 1.2276422764227641) internal successors, (302), 266 states have internal predecessors, (302), 0 states have call successors, (0), 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:41:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2024-11-17 00:41:41,088 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 40 [2024-11-17 00:41:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:41,089 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2024-11-17 00:41:41,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 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:41:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2024-11-17 00:41:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:41:41,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:41,089 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:41,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:41:41,290 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,SelfDestructingSolverStorable27 [2024-11-17 00:41:41,290 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:41,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1458946322, now seen corresponding path program 1 times [2024-11-17 00:41:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:41,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641940671] [2024-11-17 00:41:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:41,505 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:41:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641940671] [2024-11-17 00:41:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641940671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229323760] [2024-11-17 00:41:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:41,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:41,508 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:41:41,509 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:41:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:41,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 00:41:41,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:41,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:41,752 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:41:41,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:42,048 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 20 treesize of output 18 [2024-11-17 00:41:42,051 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 46 treesize of output 42 [2024-11-17 00:41:42,070 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:41:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229323760] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:41:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2024-11-17 00:41:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338547785] [2024-11-17 00:41:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:41:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:41:42,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-17 00:41:42,071 INFO L87 Difference]: Start difference. First operand 267 states and 302 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:42,322 INFO L93 Difference]: Finished difference Result 273 states and 308 transitions. [2024-11-17 00:41:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:41:42,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-17 00:41:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:42,323 INFO L225 Difference]: With dead ends: 273 [2024-11-17 00:41:42,323 INFO L226 Difference]: Without dead ends: 273 [2024-11-17 00:41:42,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:41:42,324 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 205 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:42,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 541 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:41:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-17 00:41:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2024-11-17 00:41:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.2254098360655739) internal successors, (299), 264 states have internal predecessors, (299), 0 states have call successors, (0), 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:41:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 299 transitions. [2024-11-17 00:41:42,327 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 299 transitions. Word has length 41 [2024-11-17 00:41:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:42,327 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 299 transitions. [2024-11-17 00:41:42,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:41:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 299 transitions. [2024-11-17 00:41:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:41:42,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:42,328 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:42,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:41:42,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-17 00:41:42,533 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:41:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash 357345812, now seen corresponding path program 1 times [2024-11-17 00:41:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592189952] [2024-11-17 00:41:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:43,515 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:41:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592189952] [2024-11-17 00:41:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592189952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014630100] [2024-11-17 00:41:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:43,517 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:41:43,518 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:41:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:43,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-17 00:41:43,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:43,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:41:43,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:43,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:43,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:41:43,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:41:43,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:43,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:43,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:43,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:41:43,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:43,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:43,919 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-17 00:41:43,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 48 [2024-11-17 00:41:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:41:44,058 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:41:44,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:41:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:44,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:41:44,149 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:41:44,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:41:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:44,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:41:44,180 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:41:44,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-17 00:41:44,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:41:44,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:44,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-17 00:41:44,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:41:44,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-17 00:41:44,476 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:41:44,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:44,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1169 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2024-11-17 00:41:44,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1164 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1164) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_1162)) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1170) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1169 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_1162)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1169)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2024-11-17 00:41:44,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_14| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_14| .cse0) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1164 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1164) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_14| 4) v_ArrVal_1162)) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1170) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_14| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_14| .cse0) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1169 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_14| 4) v_ArrVal_1162)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1169)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))) is different from false [2024-11-17 00:41:45,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:45,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 74 [2024-11-17 00:41:45,173 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:45,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 202 treesize of output 170 [2024-11-17 00:41:45,186 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 33 treesize of output 29 [2024-11-17 00:41:45,190 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 54 treesize of output 46 [2024-11-17 00:41:45,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,209 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-17 00:41:45,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-17 00:41:45,245 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:41:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014630100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:41:45,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:41:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 38 [2024-11-17 00:41:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520076015] [2024-11-17 00:41:45,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-17 00:41:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-17 00:41:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=992, Unknown=43, NotChecked=204, Total=1406 [2024-11-17 00:41:45,247 INFO L87 Difference]: Start difference. First operand 265 states and 299 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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:41:49,369 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:41:53,397 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:41:57,514 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:42:01,521 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:42:06,296 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:42:10,426 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:42:14,476 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:42:22,780 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, 1] [2024-11-17 00:42:23,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1169 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-17 00:42:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:29,231 INFO L93 Difference]: Finished difference Result 660 states and 738 transitions. [2024-11-17 00:42:29,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-17 00:42:29,231 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 43 [2024-11-17 00:42:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:29,233 INFO L225 Difference]: With dead ends: 660 [2024-11-17 00:42:29,233 INFO L226 Difference]: Without dead ends: 660 [2024-11-17 00:42:29,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=740, Invalid=3602, Unknown=96, NotChecked=532, Total=4970 [2024-11-17 00:42:29,235 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 762 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 149 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 1410 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:29,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1864 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1897 Invalid, 52 Unknown, 1410 Unchecked, 34.1s Time] [2024-11-17 00:42:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-17 00:42:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 285. [2024-11-17 00:42:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 264 states have (on average 1.231060606060606) internal successors, (325), 284 states have internal predecessors, (325), 0 states have call successors, (0), 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:42:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2024-11-17 00:42:29,239 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 43 [2024-11-17 00:42:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:29,239 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2024-11-17 00:42:29,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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:42:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2024-11-17 00:42:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:42:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:29,240 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:29,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:42:29,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:29,441 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2024-11-17 00:42:29,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1093384127, now seen corresponding path program 1 times [2024-11-17 00:42:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:29,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062419296] [2024-11-17 00:42:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:30,323 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:42:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062419296] [2024-11-17 00:42:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062419296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680752522] [2024-11-17 00:42:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:30,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:30,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:30,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:42:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:30,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-17 00:42:30,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:30,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:30,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:30,658 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:42:30,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:42:30,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:30,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:42:30,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:42:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:30,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:30,859 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-17 00:42:30,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 48 [2024-11-17 00:42:30,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:42:31,024 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:31,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:42:31,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:42:31,080 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:31,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-17 00:42:31,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:42:31,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:42:31,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:42:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,175 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-17 00:42:31,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2024-11-17 00:42:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:42:31,320 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-17 00:42:31,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 73 [2024-11-17 00:42:31,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:42:31,331 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 20 treesize of output 12 [2024-11-17 00:42:31,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-17 00:42:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:31,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:42:31,653 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:42:31,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:31,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1320) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1321) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false