./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_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/list-ext-properties/test-0513_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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:25:26,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:25:26,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:25:26,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:25:26,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:25:26,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:25:26,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:25:26,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:25:26,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:25:26,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:25:26,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:25:26,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:25:26,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:25:26,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:25:26,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:25:26,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:25:26,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:25:26,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:25:26,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:25:26,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:25:26,788 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:25:26,789 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:25:26,789 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:25:26,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:25:26,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:25:26,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:25:26,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:25:26,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:25:26,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:25:26,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:25:26,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:25:26,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:25:26,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:25:26,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:25:26,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:25:26,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:25:26,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:25:26,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:25:26,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:25:26,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:25:26,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:25:26,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:25:26,794 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2024-11-17 00:25:27,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:25:27,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:25:27,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:25:27,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:25:27,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:25:27,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-11-17 00:25:28,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:25:28,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:25:28,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-11-17 00:25:28,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e14944c7f/312d30786abf4a7ab860ec759b7faa7c/FLAG35abcd86c [2024-11-17 00:25:28,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e14944c7f/312d30786abf4a7ab860ec759b7faa7c [2024-11-17 00:25:28,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:25:28,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:25:28,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:25:28,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:25:28,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:25:28,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:28" (1/1) ... [2024-11-17 00:25:28,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d57cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:28, skipping insertion in model container [2024-11-17 00:25:28,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:28" (1/1) ... [2024-11-17 00:25:29,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:25:29,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:25:29,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:25:29,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:25:29,339 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:25:29,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29 WrapperNode [2024-11-17 00:25:29,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:25:29,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:25:29,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:25:29,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:25:29,347 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:25:29" (1/1) ... [2024-11-17 00:25:29,364 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:25:29" (1/1) ... [2024-11-17 00:25:29,394 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2024-11-17 00:25:29,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:25:29,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:25:29,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:25:29,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:25:29,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,427 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2024-11-17 00:25:29,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:25:29,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:25:29,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:25:29,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:25:29,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (1/1) ... [2024-11-17 00:25:29,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:25:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:29,483 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:25:29,486 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:25:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:25:29,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:25:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:25:29,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:25:29,623 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:25:29,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:25:30,033 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-17 00:25:30,033 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:25:30,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:25:30,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:25:30,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:25:30 BoogieIcfgContainer [2024-11-17 00:25:30,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:25:30,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:25:30,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:25:30,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:25:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:25:28" (1/3) ... [2024-11-17 00:25:30,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d27c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:30, skipping insertion in model container [2024-11-17 00:25:30,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:29" (2/3) ... [2024-11-17 00:25:30,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d27c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:30, skipping insertion in model container [2024-11-17 00:25:30,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:25:30" (3/3) ... [2024-11-17 00:25:30,067 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2024-11-17 00:25:30,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:25:30,082 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2024-11-17 00:25:30,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:25:30,132 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;@2572e9d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:25:30,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2024-11-17 00:25:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 88 states have (on average 2.022727272727273) internal successors, (178), 158 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:25:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:25:30,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:30,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:25:30,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1975686573, now seen corresponding path program 1 times [2024-11-17 00:25:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603046609] [2024-11-17 00:25:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,258 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:25:30,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:30,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603046609] [2024-11-17 00:25:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603046609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:30,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66856845] [2024-11-17 00:25:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:25:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:25:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:25:30,293 INFO L87 Difference]: Start difference. First operand has 159 states, 88 states have (on average 2.022727272727273) internal successors, (178), 158 states have internal predecessors, (178), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:30,322 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2024-11-17 00:25:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:25:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:25:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:30,331 INFO L225 Difference]: With dead ends: 159 [2024-11-17 00:25:30,332 INFO L226 Difference]: Without dead ends: 156 [2024-11-17 00:25:30,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:25:30,337 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:30,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-17 00:25:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-17 00:25:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 86 states have (on average 1.9767441860465116) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:25:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-17 00:25:30,378 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 6 [2024-11-17 00:25:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:30,378 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-17 00:25:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-17 00:25:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:25:30,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:30,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:25:30,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1117389967, now seen corresponding path program 1 times [2024-11-17 00:25:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968665026] [2024-11-17 00:25:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,486 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:25:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968665026] [2024-11-17 00:25:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968665026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717273956] [2024-11-17 00:25:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:30,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:30,492 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:30,657 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2024-11-17 00:25:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:25:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:30,659 INFO L225 Difference]: With dead ends: 162 [2024-11-17 00:25:30,660 INFO L226 Difference]: Without dead ends: 162 [2024-11-17 00:25:30,660 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:25:30,661 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:30,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 191 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-17 00:25:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2024-11-17 00:25:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 91 states have (on average 1.9120879120879122) internal successors, (174), 155 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:25:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2024-11-17 00:25:30,674 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 7 [2024-11-17 00:25:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:30,675 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2024-11-17 00:25:30,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2024-11-17 00:25:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:25:30,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:30,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:30,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:25:30,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1117389968, now seen corresponding path program 1 times [2024-11-17 00:25:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558543706] [2024-11-17 00:25:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,799 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:25:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558543706] [2024-11-17 00:25:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558543706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540288608] [2024-11-17 00:25:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:30,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:30,802 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:30,886 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2024-11-17 00:25:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 00:25:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:30,887 INFO L225 Difference]: With dead ends: 152 [2024-11-17 00:25:30,887 INFO L226 Difference]: Without dead ends: 152 [2024-11-17 00:25:30,887 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:25:30,888 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:30,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 218 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-17 00:25:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-17 00:25:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.8681318681318682) internal successors, (170), 151 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:25:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2024-11-17 00:25:30,896 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 7 [2024-11-17 00:25:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:30,896 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2024-11-17 00:25:30,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2024-11-17 00:25:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:25:30,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:30,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:30,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:25:30,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:30,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 279245521, now seen corresponding path program 1 times [2024-11-17 00:25:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093134110] [2024-11-17 00:25:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,913 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:25:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093134110] [2024-11-17 00:25:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093134110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:30,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:30,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201284468] [2024-11-17 00:25:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:30,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:30,916 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,040 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-11-17 00:25:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:25:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,043 INFO L225 Difference]: With dead ends: 203 [2024-11-17 00:25:31,043 INFO L226 Difference]: Without dead ends: 201 [2024-11-17 00:25:31,043 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:25:31,044 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 230 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-17 00:25:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 156. [2024-11-17 00:25:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 95 states have (on average 1.8526315789473684) internal successors, (176), 155 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:25:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2024-11-17 00:25:31,051 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 8 [2024-11-17 00:25:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,051 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2024-11-17 00:25:31,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2024-11-17 00:25:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:25:31,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:25:31,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 279250449, now seen corresponding path program 1 times [2024-11-17 00:25:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124455050] [2024-11-17 00:25:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,075 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:25:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124455050] [2024-11-17 00:25:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124455050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128204131] [2024-11-17 00:25:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:31,078 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,121 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2024-11-17 00:25:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:25:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,122 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:25:31,122 INFO L226 Difference]: Without dead ends: 165 [2024-11-17 00:25:31,123 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:25:31,128 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 277 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-17 00:25:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-17 00:25:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.7980769230769231) internal successors, (187), 164 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:25:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-17 00:25:31,140 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 8 [2024-11-17 00:25:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-17 00:25:31,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-17 00:25:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:25:31,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:31,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:25:31,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2112470305, now seen corresponding path program 1 times [2024-11-17 00:25:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669406047] [2024-11-17 00:25:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,212 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:25:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669406047] [2024-11-17 00:25:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669406047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264671293] [2024-11-17 00:25:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:31,215 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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:25:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,251 INFO L93 Difference]: Finished difference Result 311 states and 345 transitions. [2024-11-17 00:25:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:25:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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:25:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,252 INFO L225 Difference]: With dead ends: 311 [2024-11-17 00:25:31,252 INFO L226 Difference]: Without dead ends: 311 [2024-11-17 00:25:31,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:31,253 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 154 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 475 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-17 00:25:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 168. [2024-11-17 00:25:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 107 states have (on average 1.7476635514018692) internal successors, (187), 167 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:25:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 187 transitions. [2024-11-17 00:25:31,258 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 187 transitions. Word has length 13 [2024-11-17 00:25:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,258 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 187 transitions. [2024-11-17 00:25:31,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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:25:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 187 transitions. [2024-11-17 00:25:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:25:31,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,259 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:25:31,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:25:31,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1429072560, now seen corresponding path program 1 times [2024-11-17 00:25:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096162903] [2024-11-17 00:25:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,317 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:25:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096162903] [2024-11-17 00:25:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096162903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320058154] [2024-11-17 00:25:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:31,318 INFO L87 Difference]: Start difference. First operand 168 states and 187 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,393 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2024-11-17 00:25:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,394 INFO L225 Difference]: With dead ends: 164 [2024-11-17 00:25:31,394 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 00:25:31,394 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:25:31,395 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 19 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 215 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 00:25:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-17 00:25:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.7102803738317758) internal successors, (183), 163 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:25:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2024-11-17 00:25:31,399 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 16 [2024-11-17 00:25:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2024-11-17 00:25:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2024-11-17 00:25:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:25:31,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,399 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:25:31,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:25:31,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1429072561, now seen corresponding path program 1 times [2024-11-17 00:25:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556010713] [2024-11-17 00:25:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,493 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:25:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556010713] [2024-11-17 00:25:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556010713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597597326] [2024-11-17 00:25:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:31,495 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,571 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2024-11-17 00:25:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,572 INFO L225 Difference]: With dead ends: 161 [2024-11-17 00:25:31,572 INFO L226 Difference]: Without dead ends: 161 [2024-11-17 00:25:31,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:31,573 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 229 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-17 00:25:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-17 00:25:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 107 states have (on average 1.6822429906542056) internal successors, (180), 160 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:25:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2024-11-17 00:25:31,576 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 16 [2024-11-17 00:25:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,576 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2024-11-17 00:25:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:25:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2024-11-17 00:25:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:25:31,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:31,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:25:31,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1447726707, now seen corresponding path program 1 times [2024-11-17 00:25:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658367522] [2024-11-17 00:25:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658367522] [2024-11-17 00:25:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658367522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120784213] [2024-11-17 00:25:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:31,631 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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:25:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,705 INFO L93 Difference]: Finished difference Result 234 states and 276 transitions. [2024-11-17 00:25:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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:25:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,707 INFO L225 Difference]: With dead ends: 234 [2024-11-17 00:25:31,707 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 00:25:31,707 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:25:31,707 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 101 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 341 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 00:25:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 161. [2024-11-17 00:25:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 107 states have (on average 1.6635514018691588) internal successors, (178), 160 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:25:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 178 transitions. [2024-11-17 00:25:31,711 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 178 transitions. Word has length 25 [2024-11-17 00:25:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,711 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 178 transitions. [2024-11-17 00:25:31,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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:25:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2024-11-17 00:25:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:25:31,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:31,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:25:31,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1447731635, now seen corresponding path program 1 times [2024-11-17 00:25:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930490596] [2024-11-17 00:25:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930490596] [2024-11-17 00:25:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930490596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016783923] [2024-11-17 00:25:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:31,798 INFO L87 Difference]: Start difference. First operand 161 states and 178 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,938 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2024-11-17 00:25:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:31,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,940 INFO L225 Difference]: With dead ends: 155 [2024-11-17 00:25:31,940 INFO L226 Difference]: Without dead ends: 155 [2024-11-17 00:25:31,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:31,942 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 48 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 307 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-17 00:25:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-17 00:25:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 154 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:25:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2024-11-17 00:25:31,945 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 25 [2024-11-17 00:25:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2024-11-17 00:25:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2024-11-17 00:25:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:25:31,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:25:31,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:31,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1447731636, now seen corresponding path program 1 times [2024-11-17 00:25:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381501041] [2024-11-17 00:25:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381501041] [2024-11-17 00:25:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381501041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210742898] [2024-11-17 00:25:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:32,100 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,271 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2024-11-17 00:25:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,272 INFO L225 Difference]: With dead ends: 221 [2024-11-17 00:25:32,272 INFO L226 Difference]: Without dead ends: 221 [2024-11-17 00:25:32,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:32,273 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 89 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 347 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-17 00:25:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2024-11-17 00:25:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.6143790849673203) internal successors, (247), 196 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:25:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2024-11-17 00:25:32,276 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 25 [2024-11-17 00:25:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,276 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2024-11-17 00:25:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:25:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2024-11-17 00:25:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:25:32,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,277 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:32,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:25:32,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -88342618, now seen corresponding path program 1 times [2024-11-17 00:25:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829355939] [2024-11-17 00:25:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829355939] [2024-11-17 00:25:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829355939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197614837] [2024-11-17 00:25:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:32,337 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,418 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2024-11-17 00:25:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-17 00:25:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,420 INFO L225 Difference]: With dead ends: 222 [2024-11-17 00:25:32,420 INFO L226 Difference]: Without dead ends: 222 [2024-11-17 00:25:32,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:32,421 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 91 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-17 00:25:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2024-11-17 00:25:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6103896103896105) internal successors, (248), 197 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:25:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2024-11-17 00:25:32,425 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 30 [2024-11-17 00:25:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2024-11-17 00:25:32,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2024-11-17 00:25:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:25:32,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:25:32,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -85079546, now seen corresponding path program 1 times [2024-11-17 00:25:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940122488] [2024-11-17 00:25:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940122488] [2024-11-17 00:25:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940122488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995425699] [2024-11-17 00:25:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:32,576 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,773 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2024-11-17 00:25:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:32,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-17 00:25:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,775 INFO L225 Difference]: With dead ends: 224 [2024-11-17 00:25:32,775 INFO L226 Difference]: Without dead ends: 224 [2024-11-17 00:25:32,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:25:32,775 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 14 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 425 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-17 00:25:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-17 00:25:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.5868263473053892) internal successors, (265), 210 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:25:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 265 transitions. [2024-11-17 00:25:32,782 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 265 transitions. Word has length 30 [2024-11-17 00:25:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,782 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 265 transitions. [2024-11-17 00:25:32,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 265 transitions. [2024-11-17 00:25:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:25:32,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:32,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:25:32,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:32,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -85079545, now seen corresponding path program 1 times [2024-11-17 00:25:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143927218] [2024-11-17 00:25:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:33,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143927218] [2024-11-17 00:25:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143927218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:33,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:33,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:25:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175635670] [2024-11-17 00:25:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:33,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:33,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:33,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:33,037 INFO L87 Difference]: Start difference. First operand 211 states and 265 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:33,160 INFO L93 Difference]: Finished difference Result 212 states and 264 transitions. [2024-11-17 00:25:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-17 00:25:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:33,161 INFO L225 Difference]: With dead ends: 212 [2024-11-17 00:25:33,161 INFO L226 Difference]: Without dead ends: 212 [2024-11-17 00:25:33,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:25:33,162 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 7 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:33,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 544 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-17 00:25:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2024-11-17 00:25:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 163 states have (on average 1.5889570552147239) internal successors, (259), 206 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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:25:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 259 transitions. [2024-11-17 00:25:33,169 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 259 transitions. Word has length 30 [2024-11-17 00:25:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:33,169 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 259 transitions. [2024-11-17 00:25:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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:25:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 259 transitions. [2024-11-17 00:25:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:25:33,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:33,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:33,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:25:33,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1048136072, now seen corresponding path program 1 times [2024-11-17 00:25:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583938215] [2024-11-17 00:25:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583938215] [2024-11-17 00:25:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583938215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:25:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082484293] [2024-11-17 00:25:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:25:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:25:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:25:33,512 INFO L87 Difference]: Start difference. First operand 207 states and 259 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:33,789 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2024-11-17 00:25:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:25:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-17 00:25:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:33,791 INFO L225 Difference]: With dead ends: 267 [2024-11-17 00:25:33,791 INFO L226 Difference]: Without dead ends: 267 [2024-11-17 00:25:33,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:25:33,791 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 100 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:33,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 434 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-17 00:25:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 236. [2024-11-17 00:25:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.5416666666666667) internal successors, (296), 235 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:25:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 296 transitions. [2024-11-17 00:25:33,796 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 296 transitions. Word has length 35 [2024-11-17 00:25:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:33,796 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 296 transitions. [2024-11-17 00:25:33,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2024-11-17 00:25:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:25:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:33,796 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:25:33,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1048136071, now seen corresponding path program 1 times [2024-11-17 00:25:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805039591] [2024-11-17 00:25:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805039591] [2024-11-17 00:25:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805039591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:34,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:34,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:25:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976950609] [2024-11-17 00:25:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:25:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:25:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:25:34,163 INFO L87 Difference]: Start difference. First operand 236 states and 296 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:34,570 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2024-11-17 00:25:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:25:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-17 00:25:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:34,571 INFO L225 Difference]: With dead ends: 296 [2024-11-17 00:25:34,571 INFO L226 Difference]: Without dead ends: 296 [2024-11-17 00:25:34,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:25:34,572 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 124 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:34,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 548 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:25:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-17 00:25:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 236. [2024-11-17 00:25:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.5364583333333333) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:25:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 295 transitions. [2024-11-17 00:25:34,575 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 295 transitions. Word has length 35 [2024-11-17 00:25:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 295 transitions. [2024-11-17 00:25:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 295 transitions. [2024-11-17 00:25:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:25:34,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:34,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:25:34,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2058549205, now seen corresponding path program 1 times [2024-11-17 00:25:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404817446] [2024-11-17 00:25:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:25:34,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404817446] [2024-11-17 00:25:34,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404817446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:34,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:34,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:34,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706297075] [2024-11-17 00:25:34,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:34,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:34,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:34,617 INFO L87 Difference]: Start difference. First operand 236 states and 295 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:34,750 INFO L93 Difference]: Finished difference Result 308 states and 390 transitions. [2024-11-17 00:25:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:34,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:25:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:34,751 INFO L225 Difference]: With dead ends: 308 [2024-11-17 00:25:34,751 INFO L226 Difference]: Without dead ends: 308 [2024-11-17 00:25:34,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:34,751 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 83 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:34,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 300 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-17 00:25:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 240. [2024-11-17 00:25:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.53) internal successors, (306), 239 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:25:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 306 transitions. [2024-11-17 00:25:34,755 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 306 transitions. Word has length 37 [2024-11-17 00:25:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:34,755 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 306 transitions. [2024-11-17 00:25:34,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:25:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 306 transitions. [2024-11-17 00:25:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:25:34,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:34,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:25:34,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:34,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2058549206, now seen corresponding path program 1 times [2024-11-17 00:25:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172665569] [2024-11-17 00:25:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172665569] [2024-11-17 00:25:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172665569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:25:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88540878] [2024-11-17 00:25:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:25:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:25:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:25:35,355 INFO L87 Difference]: Start difference. First operand 240 states and 306 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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:25:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:35,938 INFO L93 Difference]: Finished difference Result 289 states and 363 transitions. [2024-11-17 00:25:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:25:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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:25:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:35,939 INFO L225 Difference]: With dead ends: 289 [2024-11-17 00:25:35,939 INFO L226 Difference]: Without dead ends: 289 [2024-11-17 00:25:35,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:25:35,940 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 63 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:35,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 568 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:25:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-17 00:25:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2024-11-17 00:25:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 214 states have (on average 1.5046728971962617) internal successors, (322), 253 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:25:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 322 transitions. [2024-11-17 00:25:35,944 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 322 transitions. Word has length 37 [2024-11-17 00:25:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 322 transitions. [2024-11-17 00:25:35,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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:25:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2024-11-17 00:25:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:25:35,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:35,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:35,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:25:35,946 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:35,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2058468739, now seen corresponding path program 1 times [2024-11-17 00:25:35,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:35,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183217952] [2024-11-17 00:25:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183217952] [2024-11-17 00:25:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183217952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:25:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078077742] [2024-11-17 00:25:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:36,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:36,132 INFO L87 Difference]: Start difference. First operand 254 states and 322 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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:25:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:36,259 INFO L93 Difference]: Finished difference Result 256 states and 323 transitions. [2024-11-17 00:25:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:25:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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:25:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:36,260 INFO L225 Difference]: With dead ends: 256 [2024-11-17 00:25:36,260 INFO L226 Difference]: Without dead ends: 256 [2024-11-17 00:25:36,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:25:36,261 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 22 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:36,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 446 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-17 00:25:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-11-17 00:25:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 214 states have (on average 1.5) internal successors, (321), 253 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:25:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 321 transitions. [2024-11-17 00:25:36,265 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 321 transitions. Word has length 37 [2024-11-17 00:25:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:36,266 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 321 transitions. [2024-11-17 00:25:36,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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:25:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 321 transitions. [2024-11-17 00:25:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:25:36,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:36,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:36,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:25:36,267 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:36,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1981072978, now seen corresponding path program 1 times [2024-11-17 00:25:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880726592] [2024-11-17 00:25:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:25:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880726592] [2024-11-17 00:25:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880726592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588923420] [2024-11-17 00:25:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:36,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:36,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:36,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:36,302 INFO L87 Difference]: Start difference. First operand 254 states and 321 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:25:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:36,309 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2024-11-17 00:25:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:36,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 41 [2024-11-17 00:25:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:36,310 INFO L225 Difference]: With dead ends: 255 [2024-11-17 00:25:36,310 INFO L226 Difference]: Without dead ends: 255 [2024-11-17 00:25:36,310 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:25:36,311 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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:25:36,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-17 00:25:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-11-17 00:25:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 215 states have (on average 1.4976744186046511) internal successors, (322), 254 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:25:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2024-11-17 00:25:36,315 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 41 [2024-11-17 00:25:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:36,315 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2024-11-17 00:25:36,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:25:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2024-11-17 00:25:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:25:36,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:36,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:36,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:25:36,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:36,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1139788880, now seen corresponding path program 1 times [2024-11-17 00:25:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:36,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965902252] [2024-11-17 00:25:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965902252] [2024-11-17 00:25:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965902252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:25:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465041318] [2024-11-17 00:25:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:25:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:25:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:25:36,647 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:37,009 INFO L93 Difference]: Finished difference Result 330 states and 407 transitions. [2024-11-17 00:25:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:25:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-17 00:25:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:37,010 INFO L225 Difference]: With dead ends: 330 [2024-11-17 00:25:37,010 INFO L226 Difference]: Without dead ends: 330 [2024-11-17 00:25:37,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:25:37,011 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 117 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:37,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 660 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:25:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-17 00:25:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 263. [2024-11-17 00:25:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 223 states have (on average 1.4977578475336324) internal successors, (334), 262 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:25:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 334 transitions. [2024-11-17 00:25:37,015 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 334 transitions. Word has length 43 [2024-11-17 00:25:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 334 transitions. [2024-11-17 00:25:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 334 transitions. [2024-11-17 00:25:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:25:37,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:37,016 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:25:37,016 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1140670721, now seen corresponding path program 1 times [2024-11-17 00:25:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907234553] [2024-11-17 00:25:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907234553] [2024-11-17 00:25:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907234553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424941317] [2024-11-17 00:25:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:37,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:37,586 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:25:37,587 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:25:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:37,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 00:25:37,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:37,779 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 19 treesize of output 1 [2024-11-17 00:25:37,830 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:25:37,830 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 18 treesize of output 17 [2024-11-17 00:25:37,843 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 7 treesize of output 3 [2024-11-17 00:25:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:25:37,909 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:25:37,910 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 34 treesize of output 37 [2024-11-17 00:25:37,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:25:38,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2024-11-17 00:25:38,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:38,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2024-11-17 00:25:38,136 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:25:38,238 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 19 treesize of output 7 [2024-11-17 00:25:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:38,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:38,335 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 10 treesize of output 8 [2024-11-17 00:25:38,531 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 101 treesize of output 93 [2024-11-17 00:25:38,545 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 102 treesize of output 94 [2024-11-17 00:25:38,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_685 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (or (= v_arrayElimCell_10 |c_ULTIMATE.start_main_~data~0#1.base|) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_685) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11)))))) (.cse5 (not .cse4)) (.cse6 (not .cse1)) (.cse8 (forall ((v_ArrVal_685 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_685) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3))))) (and (or .cse0 .cse1) (forall ((v_arrayElimCell_10 Int)) (or (= v_arrayElimCell_10 |c_ULTIMATE.start_main_~data~0#1.base|) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_685))) (or (< 1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (forall ((v_arrayElimCell_11 Int)) (< 1 (select (select .cse2 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))))))) (or .cse4 .cse0) (or .cse5 .cse6 (and (forall ((v_arrayElimCell_10 Int) (v_ArrVal_685 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_685))) (or (< 1 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (forall ((v_arrayElimCell_11 Int)) (< 1 (select (select .cse7 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))))) .cse8)) (or .cse5 .cse6 .cse8)))) (and .cse4 (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse1))) is different from false [2024-11-17 00:25:39,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:39,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 103 [2024-11-17 00:25:39,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:39,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 175 [2024-11-17 00:25:39,339 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 50 [2024-11-17 00:25:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424941317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:39,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 43 [2024-11-17 00:25:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124999393] [2024-11-17 00:25:39,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:39,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 00:25:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 00:25:39,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1558, Unknown=10, NotChecked=80, Total=1806 [2024-11-17 00:25:39,428 INFO L87 Difference]: Start difference. First operand 263 states and 334 transitions. Second operand has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:25:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:41,416 INFO L93 Difference]: Finished difference Result 289 states and 361 transitions. [2024-11-17 00:25:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:25:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 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:25:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:41,417 INFO L225 Difference]: With dead ends: 289 [2024-11-17 00:25:41,418 INFO L226 Difference]: Without dead ends: 289 [2024-11-17 00:25:41,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=429, Invalid=3096, Unknown=19, NotChecked=116, Total=3660 [2024-11-17 00:25:41,420 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 443 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 26 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:41,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1543 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1583 Invalid, 15 Unknown, 196 Unchecked, 1.1s Time] [2024-11-17 00:25:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-17 00:25:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 263. [2024-11-17 00:25:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 223 states have (on average 1.493273542600897) internal successors, (333), 262 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:25:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 333 transitions. [2024-11-17 00:25:41,423 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 333 transitions. Word has length 43 [2024-11-17 00:25:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:41,423 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 333 transitions. [2024-11-17 00:25:41,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:25:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 333 transitions. [2024-11-17 00:25:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:25:41,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:41,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:41,438 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:25:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:25:41,629 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 973716891, now seen corresponding path program 1 times [2024-11-17 00:25:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417279973] [2024-11-17 00:25:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417279973] [2024-11-17 00:25:41,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417279973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:41,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:41,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:25:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65003549] [2024-11-17 00:25:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:25:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:41,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:25:41,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:25:41,820 INFO L87 Difference]: Start difference. First operand 263 states and 333 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:42,006 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2024-11-17 00:25:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:25:42,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-17 00:25:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:42,007 INFO L225 Difference]: With dead ends: 275 [2024-11-17 00:25:42,007 INFO L226 Difference]: Without dead ends: 275 [2024-11-17 00:25:42,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:25:42,008 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:42,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 659 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-17 00:25:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2024-11-17 00:25:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 227 states have (on average 1.4889867841409692) internal successors, (338), 266 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:25:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 338 transitions. [2024-11-17 00:25:42,011 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 338 transitions. Word has length 44 [2024-11-17 00:25:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:42,012 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 338 transitions. [2024-11-17 00:25:42,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 338 transitions. [2024-11-17 00:25:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:25:42,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:42,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:42,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:25:42,013 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 120504191, now seen corresponding path program 1 times [2024-11-17 00:25:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115217580] [2024-11-17 00:25:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:42,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:42,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115217580] [2024-11-17 00:25:42,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115217580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:42,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:42,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-17 00:25:42,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635083697] [2024-11-17 00:25:42,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:42,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:25:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:42,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:25:42,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:25:42,573 INFO L87 Difference]: Start difference. First operand 267 states and 338 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:43,081 INFO L93 Difference]: Finished difference Result 275 states and 345 transitions. [2024-11-17 00:25:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:25:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-17 00:25:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:43,082 INFO L225 Difference]: With dead ends: 275 [2024-11-17 00:25:43,083 INFO L226 Difference]: Without dead ends: 275 [2024-11-17 00:25:43,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:25:43,083 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 59 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:43,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1103 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:25:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-17 00:25:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2024-11-17 00:25:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 227 states have (on average 1.4845814977973568) internal successors, (337), 266 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:25:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 337 transitions. [2024-11-17 00:25:43,087 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 337 transitions. Word has length 45 [2024-11-17 00:25:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:43,087 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 337 transitions. [2024-11-17 00:25:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 337 transitions. [2024-11-17 00:25:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:25:43,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:43,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:25:43,088 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:43,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1317889339, now seen corresponding path program 1 times [2024-11-17 00:25:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900638126] [2024-11-17 00:25:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900638126] [2024-11-17 00:25:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900638126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203466794] [2024-11-17 00:25:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:43,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:43,157 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:25:43,158 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:25:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:43,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:25:43,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:25:43,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:25:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203466794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:25:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-17 00:25:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561605013] [2024-11-17 00:25:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:43,301 INFO L87 Difference]: Start difference. First operand 267 states and 337 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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:25:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:43,323 INFO L93 Difference]: Finished difference Result 445 states and 563 transitions. [2024-11-17 00:25:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 46 [2024-11-17 00:25:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:43,324 INFO L225 Difference]: With dead ends: 445 [2024-11-17 00:25:43,324 INFO L226 Difference]: Without dead ends: 444 [2024-11-17 00:25:43,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:25:43,325 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 113 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:43,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 478 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-17 00:25:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 279. [2024-11-17 00:25:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.4476987447698744) internal successors, (346), 278 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:25:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 346 transitions. [2024-11-17 00:25:43,330 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 346 transitions. Word has length 46 [2024-11-17 00:25:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 346 transitions. [2024-11-17 00:25:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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:25:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 346 transitions. [2024-11-17 00:25:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:25:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:43,331 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:43,344 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:25:43,535 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,SelfDestructingSolverStorable24 [2024-11-17 00:25:43,536 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1121375834, now seen corresponding path program 1 times [2024-11-17 00:25:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723237434] [2024-11-17 00:25:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:43,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723237434] [2024-11-17 00:25:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723237434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202865784] [2024-11-17 00:25:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:43,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:43,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:43,603 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:25:43,607 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:25:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:43,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:25:43,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:43,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202865784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:43,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-11-17 00:25:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640054306] [2024-11-17 00:25:43,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:43,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:43,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:43,791 INFO L87 Difference]: Start difference. First operand 279 states and 346 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:25:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:43,839 INFO L93 Difference]: Finished difference Result 1140 states and 1468 transitions. [2024-11-17 00:25:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:25:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-17 00:25:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:43,842 INFO L225 Difference]: With dead ends: 1140 [2024-11-17 00:25:43,842 INFO L226 Difference]: Without dead ends: 1140 [2024-11-17 00:25:43,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:43,843 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 1041 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:43,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1030 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-17 00:25:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 311. [2024-11-17 00:25:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 271 states have (on average 1.4132841328413284) internal successors, (383), 310 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:25:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 383 transitions. [2024-11-17 00:25:43,850 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 383 transitions. Word has length 46 [2024-11-17 00:25:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:43,850 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 383 transitions. [2024-11-17 00:25:43,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:25:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 383 transitions. [2024-11-17 00:25:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:25:43,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:43,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-17 00:25:43,864 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:25:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:44,052 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash -559409796, now seen corresponding path program 1 times [2024-11-17 00:25:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018590053] [2024-11-17 00:25:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:44,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018590053] [2024-11-17 00:25:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018590053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200459592] [2024-11-17 00:25:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:44,223 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:25:44,226 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:25:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:44,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:25:44,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:44,376 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:25:44,406 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:25:44,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:25:44,428 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-17 00:25:44,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:25:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:44,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200459592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:48,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-11-17 00:25:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983610313] [2024-11-17 00:25:48,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:25:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:25:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2024-11-17 00:25:48,594 INFO L87 Difference]: Start difference. First operand 311 states and 383 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:25:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:49,123 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2024-11-17 00:25:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:25:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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 48 [2024-11-17 00:25:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:49,124 INFO L225 Difference]: With dead ends: 335 [2024-11-17 00:25:49,124 INFO L226 Difference]: Without dead ends: 335 [2024-11-17 00:25:49,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=198, Invalid=731, Unknown=1, NotChecked=0, Total=930 [2024-11-17 00:25:49,125 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:49,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1020 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:25:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-17 00:25:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2024-11-17 00:25:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 271 states have (on average 1.4095940959409594) internal successors, (382), 310 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:25:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 382 transitions. [2024-11-17 00:25:49,129 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 382 transitions. Word has length 48 [2024-11-17 00:25:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:49,129 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 382 transitions. [2024-11-17 00:25:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:25:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 382 transitions. [2024-11-17 00:25:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:25:49,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:49,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-17 00:25:49,143 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:25:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 00:25:49,331 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash -559409795, now seen corresponding path program 1 times [2024-11-17 00:25:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:49,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004995952] [2024-11-17 00:25:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004995952] [2024-11-17 00:25:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004995952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941241102] [2024-11-17 00:25:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:49,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:49,719 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:25:49,720 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:25:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:49,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 00:25:49,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:49,890 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:25:49,923 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:25:49,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:25:49,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:25:49,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:25:49,961 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:25:49,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:50,001 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:50,030 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:25:50,030 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 50 treesize of output 45 [2024-11-17 00:25:50,034 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:25:50,096 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 25 treesize of output 13 [2024-11-17 00:25:50,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:25:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:50,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:50,183 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (forall ((v_ArrVal_1373 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4)))) is different from false [2024-11-17 00:25:50,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:50,189 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-17 00:25:50,191 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 34 treesize of output 26 [2024-11-17 00:25:50,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:50,199 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 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-17 00:25:50,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:50,203 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 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-17 00:25:50,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:50,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 19 [2024-11-17 00:25:50,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:50,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-11-17 00:25:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-17 00:25:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941241102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:50,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-11-17 00:25:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144996383] [2024-11-17 00:25:50,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:50,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 00:25:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:50,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 00:25:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:25:50,310 INFO L87 Difference]: Start difference. First operand 311 states and 382 transitions. Second operand has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:25:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:51,045 INFO L93 Difference]: Finished difference Result 334 states and 383 transitions. [2024-11-17 00:25:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:25:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 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 48 [2024-11-17 00:25:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:51,046 INFO L225 Difference]: With dead ends: 334 [2024-11-17 00:25:51,046 INFO L226 Difference]: Without dead ends: 334 [2024-11-17 00:25:51,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=808, Unknown=1, NotChecked=60, Total=1056 [2024-11-17 00:25:51,047 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 279 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:51,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1278 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1195 Invalid, 0 Unknown, 190 Unchecked, 0.6s Time] [2024-11-17 00:25:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-17 00:25:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 311. [2024-11-17 00:25:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 271 states have (on average 1.4059040590405905) internal successors, (381), 310 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:25:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 381 transitions. [2024-11-17 00:25:51,050 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 381 transitions. Word has length 48 [2024-11-17 00:25:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:51,050 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 381 transitions. [2024-11-17 00:25:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:25:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 381 transitions. [2024-11-17 00:25:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:25:51,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:51,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:51,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:25:51,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 00:25:51,252 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:51,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 783585603, now seen corresponding path program 1 times [2024-11-17 00:25:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:51,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81840773] [2024-11-17 00:25:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81840773] [2024-11-17 00:25:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81840773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555825202] [2024-11-17 00:25:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:51,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:25:51,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:25:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:51,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-17 00:25:51,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:51,911 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:25:51,914 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:25:51,923 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:25:51,926 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:25:51,935 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:25:51,938 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:25:51,946 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:25:51,949 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:25:51,994 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:25:51,994 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:25:52,009 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:25:52,009 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:25:52,066 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:25:52,066 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 28 treesize of output 31 [2024-11-17 00:25:52,073 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 35 treesize of output 23 [2024-11-17 00:25:52,265 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:25:52,502 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2024-11-17 00:25:52,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 121 [2024-11-17 00:25:52,550 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-17 00:25:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 89 [2024-11-17 00:25:52,566 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:25:52,567 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 49 treesize of output 49 [2024-11-17 00:25:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:52,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:52,902 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 10 treesize of output 8 [2024-11-17 00:25:53,185 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 49 treesize of output 45 [2024-11-17 00:25:53,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse3 (not .cse0))) (and (or .cse0 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1469 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469) v_arrayElimCell_51) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_51)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_51 Int)) (or (forall ((v_ArrVal_1469 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469))) (or (= (select (select .cse1 v_arrayElimCell_51) 0) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_51))))) (or .cse0 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1469 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469) v_arrayElimCell_51) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_51))) (forall ((v_arrayElimCell_51 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_1469 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469))) (or (= (select (select .cse2 v_arrayElimCell_51) 0) 0) (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_51))))) (or .cse3 (forall ((v_ArrVal_1469 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_1469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1469 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1469))) (or (= (select (select .cse4 v_arrayElimCell_51) 0) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))))))) (forall ((v_ArrVal_1467 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse5 (select (store v_ArrVal_1467 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1467) .cse5) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5))))))) is different from false [2024-11-17 00:25:53,485 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 15 treesize of output 13 [2024-11-17 00:25:53,487 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 102 treesize of output 98 [2024-11-17 00:25:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555825202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:53,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 39 [2024-11-17 00:25:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887546087] [2024-11-17 00:25:53,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-17 00:25:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-17 00:25:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1246, Unknown=7, NotChecked=72, Total=1482 [2024-11-17 00:25:53,495 INFO L87 Difference]: Start difference. First operand 311 states and 381 transitions. Second operand has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:25:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:54,454 INFO L93 Difference]: Finished difference Result 321 states and 392 transitions. [2024-11-17 00:25:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:25:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 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 49 [2024-11-17 00:25:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:54,456 INFO L225 Difference]: With dead ends: 321 [2024-11-17 00:25:54,456 INFO L226 Difference]: Without dead ends: 321 [2024-11-17 00:25:54,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=1745, Unknown=7, NotChecked=86, Total=2070 [2024-11-17 00:25:54,458 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 46 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:54,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1713 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1361 Invalid, 0 Unknown, 98 Unchecked, 0.7s Time] [2024-11-17 00:25:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-17 00:25:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2024-11-17 00:25:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 275 states have (on average 1.4) internal successors, (385), 314 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:25:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2024-11-17 00:25:54,465 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 49 [2024-11-17 00:25:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2024-11-17 00:25:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8461538461538463) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:25:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2024-11-17 00:25:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:25:54,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:54,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:54,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:25:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-17 00:25:54,668 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1406407054, now seen corresponding path program 1 times [2024-11-17 00:25:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405203062] [2024-11-17 00:25:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405203062] [2024-11-17 00:25:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405203062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217966894] [2024-11-17 00:25:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:55,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:25:55,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:25:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:55,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 00:25:55,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:55,156 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:25:55,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2024-11-17 00:25:55,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:25:55,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:55,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-11-17 00:25:55,428 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:25:55,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2024-11-17 00:25:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:55,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:55,819 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 88 treesize of output 80 [2024-11-17 00:25:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217966894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:56,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2024-11-17 00:25:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112787434] [2024-11-17 00:25:56,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-17 00:25:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-17 00:25:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 00:25:56,468 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 33 states, 32 states have (on average 4.125) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:25:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:57,627 INFO L93 Difference]: Finished difference Result 318 states and 387 transitions. [2024-11-17 00:25:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:25:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.125) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-17 00:25:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:57,628 INFO L225 Difference]: With dead ends: 318 [2024-11-17 00:25:57,628 INFO L226 Difference]: Without dead ends: 288 [2024-11-17 00:25:57,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2024-11-17 00:25:57,629 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 15 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:57,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1273 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:25:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-17 00:25:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-17 00:25:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 248 states have (on average 1.435483870967742) internal successors, (356), 287 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:25:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 356 transitions. [2024-11-17 00:25:57,635 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 356 transitions. Word has length 51 [2024-11-17 00:25:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:57,635 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 356 transitions. [2024-11-17 00:25:57,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.125) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:25:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 356 transitions. [2024-11-17 00:25:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:25:57,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:57,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-17 00:25:57,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 00:25:57,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:57,841 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:57,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2039412726, now seen corresponding path program 1 times [2024-11-17 00:25:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:57,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265099079] [2024-11-17 00:25:57,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-17 00:25:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265099079] [2024-11-17 00:25:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265099079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175746592] [2024-11-17 00:25:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:57,944 INFO L87 Difference]: Start difference. First operand 288 states and 356 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:25:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:58,087 INFO L93 Difference]: Finished difference Result 287 states and 354 transitions. [2024-11-17 00:25:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:25:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 52 [2024-11-17 00:25:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:58,089 INFO L225 Difference]: With dead ends: 287 [2024-11-17 00:25:58,089 INFO L226 Difference]: Without dead ends: 287 [2024-11-17 00:25:58,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:58,090 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 20 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:58,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 410 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-17 00:25:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-17 00:25:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 248 states have (on average 1.4274193548387097) internal successors, (354), 286 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:25:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 354 transitions. [2024-11-17 00:25:58,093 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 354 transitions. Word has length 52 [2024-11-17 00:25:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 354 transitions. [2024-11-17 00:25:58,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:25:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 354 transitions. [2024-11-17 00:25:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:25:58,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:58,094 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-17 00:25:58,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 00:25:58,094 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:58,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2039412727, now seen corresponding path program 1 times [2024-11-17 00:25:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125866704] [2024-11-17 00:25:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125866704] [2024-11-17 00:25:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125866704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 00:25:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887495193] [2024-11-17 00:25:58,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:25:58,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:25:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:25:58,398 INFO L87 Difference]: Start difference. First operand 287 states and 354 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:58,760 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2024-11-17 00:25:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:25:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:25:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:58,761 INFO L225 Difference]: With dead ends: 312 [2024-11-17 00:25:58,761 INFO L226 Difference]: Without dead ends: 312 [2024-11-17 00:25:58,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:25:58,761 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 126 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:58,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 881 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:25:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-17 00:25:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 287. [2024-11-17 00:25:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 248 states have (on average 1.4233870967741935) internal successors, (353), 286 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:25:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 353 transitions. [2024-11-17 00:25:58,766 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 353 transitions. Word has length 52 [2024-11-17 00:25:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:58,767 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 353 transitions. [2024-11-17 00:25:58,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 353 transitions. [2024-11-17 00:25:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:25:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:58,767 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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:25:58,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-17 00:25:58,767 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -421583678, now seen corresponding path program 1 times [2024-11-17 00:25:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655325625] [2024-11-17 00:25:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655325625] [2024-11-17 00:25:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655325625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367546154] [2024-11-17 00:25:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:58,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:58,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:58,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:25:58,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:25:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:59,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 00:25:59,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:59,073 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:25:59,094 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:25:59,094 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:25:59,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:25:59,109 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:25:59,118 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:59,128 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:25:59,128 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 25 treesize of output 26 [2024-11-17 00:25:59,138 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 16 treesize of output 8 [2024-11-17 00:25:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:59,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:59,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:59,166 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-17 00:25:59,168 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 33 treesize of output 25 [2024-11-17 00:25:59,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-17 00:25:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367546154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:59,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:59,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2024-11-17 00:25:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199458822] [2024-11-17 00:25:59,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:59,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:25:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:25:59,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=99, Unknown=2, NotChecked=0, Total=132 [2024-11-17 00:25:59,219 INFO L87 Difference]: Start difference. First operand 287 states and 353 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:25:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:59,436 INFO L93 Difference]: Finished difference Result 285 states and 350 transitions. [2024-11-17 00:25:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:25:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 53 [2024-11-17 00:25:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:59,437 INFO L225 Difference]: With dead ends: 285 [2024-11-17 00:25:59,437 INFO L226 Difference]: Without dead ends: 285 [2024-11-17 00:25:59,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=222, Unknown=3, NotChecked=0, Total=306 [2024-11-17 00:25:59,438 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 139 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:59,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 547 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-17 00:25:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2024-11-17 00:25:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 244 states have (on average 1.4262295081967213) internal successors, (348), 282 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:25:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2024-11-17 00:25:59,442 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 53 [2024-11-17 00:25:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:59,442 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2024-11-17 00:25:59,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:25:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2024-11-17 00:25:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:25:59,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:59,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:59,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 00:25:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-17 00:25:59,644 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:25:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -462778481, now seen corresponding path program 1 times [2024-11-17 00:25:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128667859] [2024-11-17 00:25:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128667859] [2024-11-17 00:25:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128667859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 00:25:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80307161] [2024-11-17 00:25:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:25:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:25:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:25:59,915 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:00,115 INFO L93 Difference]: Finished difference Result 307 states and 354 transitions. [2024-11-17 00:26:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:26:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-17 00:26:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:00,116 INFO L225 Difference]: With dead ends: 307 [2024-11-17 00:26:00,116 INFO L226 Difference]: Without dead ends: 307 [2024-11-17 00:26:00,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:26:00,117 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 98 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:00,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 828 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:26:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-17 00:26:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2024-11-17 00:26:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 244 states have (on average 1.4221311475409837) internal successors, (347), 282 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:26:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 347 transitions. [2024-11-17 00:26:00,120 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 347 transitions. Word has length 55 [2024-11-17 00:26:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:00,120 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 347 transitions. [2024-11-17 00:26:00,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 347 transitions. [2024-11-17 00:26:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:26:00,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:00,121 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:00,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 00:26:00,121 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:26:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1461230957, now seen corresponding path program 1 times [2024-11-17 00:26:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963047496] [2024-11-17 00:26:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963047496] [2024-11-17 00:26:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963047496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032388611] [2024-11-17 00:26:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:00,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:00,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:26:00,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:26:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:00,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:26:00,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:00,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:26:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:26:00,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 27 treesize of output 11 [2024-11-17 00:26:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:26:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:00,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032388611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:00,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-17 00:26:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726725134] [2024-11-17 00:26:00,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:00,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:26:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:26:00,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:26:00,790 INFO L87 Difference]: Start difference. First operand 283 states and 347 transitions. Second operand has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:26:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:01,035 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2024-11-17 00:26:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:26:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 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 56 [2024-11-17 00:26:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:01,036 INFO L225 Difference]: With dead ends: 302 [2024-11-17 00:26:01,036 INFO L226 Difference]: Without dead ends: 302 [2024-11-17 00:26:01,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:26:01,036 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 98 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:01,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1012 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:26:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-17 00:26:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2024-11-17 00:26:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 244 states have (on average 1.4180327868852458) internal successors, (346), 282 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:26:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2024-11-17 00:26:01,039 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 56 [2024-11-17 00:26:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:01,040 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2024-11-17 00:26:01,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:26:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2024-11-17 00:26:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-17 00:26:01,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:01,040 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:01,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:26:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-17 00:26:01,241 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:26:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 149008743, now seen corresponding path program 1 times [2024-11-17 00:26:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277816059] [2024-11-17 00:26:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:02,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277816059] [2024-11-17 00:26:02,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277816059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165625625] [2024-11-17 00:26:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:02,070 INFO L229 MonitoredProcess]: Starting monitored process 11 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:26:02,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 00:26:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:02,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-17 00:26:02,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:02,253 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:26:02,278 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:26:02,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:26:02,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:26:02,428 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-17 00:26:02,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:26:02,496 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 26 treesize of output 19 [2024-11-17 00:26:02,524 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 26 treesize of output 19 [2024-11-17 00:26:02,545 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 26 treesize of output 19 [2024-11-17 00:26:02,577 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-17 00:26:02,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:26:02,651 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 26 treesize of output 19 [2024-11-17 00:26:02,677 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 29 treesize of output 24 [2024-11-17 00:26:02,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:26:02,718 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 46 treesize of output 41 [2024-11-17 00:26:02,933 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 44 treesize of output 20 [2024-11-17 00:26:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:26:03,069 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:26:03,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-17 00:26:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:03,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:03,345 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 8 treesize of output 4 [2024-11-17 00:26:03,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (and (forall ((v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2335 Int)) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2334) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= 1 (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2335) (select .cse0 .cse1)))))) (or (forall ((v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2335 Int)) (= 1 (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2334) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2335) (select .cse3 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)))) is different from false [2024-11-17 00:26:03,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2335 Int) (v_ArrVal_2331 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2331) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2334) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2335) (select .cse0 .cse1)) 1)))) (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2335 Int) (v_ArrVal_2331 (Array Int Int))) (= (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2331) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2334) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2335) (select .cse2 .cse1))) 1))))) is different from false [2024-11-17 00:26:04,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:04,268 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 102 [2024-11-17 00:26:04,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:04,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 212 [2024-11-17 00:26:04,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:26:04,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:04,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-17 00:26:04,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:26:04,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2024-11-17 00:26:04,326 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 8 treesize of output 4 [2024-11-17 00:26:04,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:26:04,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:04,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 89 [2024-11-17 00:26:06,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:06,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 75 [2024-11-17 00:26:06,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:26:06,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 227 [2024-11-17 00:26:06,727 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 41 treesize of output 37 [2024-11-17 00:26:06,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-11-17 00:26:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165625625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:31,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 22] total 49 [2024-11-17 00:26:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338880808] [2024-11-17 00:26:31,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:26:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:26:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1979, Unknown=23, NotChecked=186, Total=2450 [2024-11-17 00:26:31,575 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand has 50 states, 49 states have (on average 3.4489795918367347) internal successors, (169), 50 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:26:40,053 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 [1] [2024-11-17 00:26:41,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:26:45,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:26:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:49,858 INFO L93 Difference]: Finished difference Result 315 states and 380 transitions. [2024-11-17 00:26:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:26:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.4489795918367347) internal successors, (169), 50 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) Word has length 61 [2024-11-17 00:26:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:49,860 INFO L225 Difference]: With dead ends: 315 [2024-11-17 00:26:49,860 INFO L226 Difference]: Without dead ends: 315 [2024-11-17 00:26:49,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=499, Invalid=2792, Unknown=23, NotChecked=226, Total=3540 [2024-11-17 00:26:49,861 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:49,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1981 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2493 Invalid, 1 Unknown, 306 Unchecked, 17.5s Time] [2024-11-17 00:26:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-17 00:26:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2024-11-17 00:26:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 241 states have (on average 1.4107883817427387) internal successors, (340), 279 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:26:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 340 transitions. [2024-11-17 00:26:49,868 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 340 transitions. Word has length 61 [2024-11-17 00:26:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:49,868 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 340 transitions. [2024-11-17 00:26:49,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.4489795918367347) internal successors, (169), 50 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:26:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 340 transitions. [2024-11-17 00:26:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-17 00:26:49,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:49,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:49,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:26:50,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-17 00:26:50,074 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2024-11-17 00:26:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 149008744, now seen corresponding path program 1 times [2024-11-17 00:26:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:50,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393005083] [2024-11-17 00:26:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:51,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:51,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393005083] [2024-11-17 00:26:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393005083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346842353] [2024-11-17 00:26:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:51,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:51,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:51,010 INFO L229 MonitoredProcess]: Starting monitored process 12 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:26:51,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 00:26:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:51,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-17 00:26:51,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:51,210 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:26:51,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:26:51,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:26:51,271 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 17 treesize of output 21 [2024-11-17 00:26:51,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:26:51,356 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:26:51,359 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:26:51,429 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:26:51,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-17 00:26:51,461 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-17 00:26:51,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:26:51,517 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 16 treesize of output 11 [2024-11-17 00:26:51,522 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 43 treesize of output 32 [2024-11-17 00:26:51,562 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 16 treesize of output 11 [2024-11-17 00:26:51,568 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 43 treesize of output 32 [2024-11-17 00:26:51,596 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 16 treesize of output 11 [2024-11-17 00:26:51,599 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 43 treesize of output 32 [2024-11-17 00:26:51,633 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-17 00:26:51,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-17 00:26:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:26:51,728 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 16 treesize of output 11 [2024-11-17 00:26:51,741 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 34 treesize of output 25 [2024-11-17 00:26:51,781 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 37 treesize of output 28 [2024-11-17 00:26:51,799 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:26:51,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:26:51,875 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 79 treesize of output 66 [2024-11-17 00:26:51,882 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 24 treesize of output 11 [2024-11-17 00:26:52,337 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 61 treesize of output 29 [2024-11-17 00:26:52,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-17 00:26:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:52,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:53,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse3 (forall ((v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2528 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2526) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_2528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2531) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (< 0 (+ 5 (select .cse5 .cse2))) (not (= (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) 0))))))) (and (forall ((v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2528 Int)) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2525) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2532) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|) (forall ((v_ArrVal_2531 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2526) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_2528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2531) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (< (+ 7 (select .cse1 .cse2)) (select |c_#length| (select .cse0 .cse2))))))))) (or (forall ((v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2525) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2532) |c_ULTIMATE.start_main_~data~0#1.base|) 0) |c_ULTIMATE.start_main_~data~0#1.base|)) .cse3) (or (and (forall ((v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2528 Int)) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2526) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_2528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2531) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (< (+ 7 (select .cse4 .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2525) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse2)))))) .cse3) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0))))) is different from false