./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.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/memsafety-ext/skiplist_2lvl.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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:28:55,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:28:55,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:28:55,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:28:55,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:28:55,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:28:55,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:28:55,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:28:55,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:28:55,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:28:55,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:28:55,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:28:55,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:28:55,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:28:55,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:28:55,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:28:55,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:28:55,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:28:55,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:28:55,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:28:55,500 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:28:55,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:28:55,504 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:28:55,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:28:55,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:28:55,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:28:55,517 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:28:55,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:28:55,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:28:55,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:28:55,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:28:55,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:28:55,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:28:55,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:28:55,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:28:55,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:28:55,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:28:55,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:28:55,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:28:55,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:28:55,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:28:55,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:28:55,521 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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2024-11-17 00:28:55,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:28:55,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:28:55,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:28:55,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:28:55,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:28:55,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-11-17 00:28:57,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:28:57,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:28:57,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-11-17 00:28:57,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a961fdf/d14ecbab530c48c19bc218e25947781b/FLAGf0ce5e96d [2024-11-17 00:28:57,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a961fdf/d14ecbab530c48c19bc218e25947781b [2024-11-17 00:28:57,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:28:57,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:28:57,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:28:57,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:28:57,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:28:57,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:28:57" (1/1) ... [2024-11-17 00:28:57,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c65387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:57, skipping insertion in model container [2024-11-17 00:28:57,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:28:57" (1/1) ... [2024-11-17 00:28:57,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:28:58,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:28:58,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:28:58,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:28:58,224 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:28:58,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58 WrapperNode [2024-11-17 00:28:58,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:28:58,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:28:58,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:28:58,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:28:58,233 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:28:58" (1/1) ... [2024-11-17 00:28:58,244 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:28:58" (1/1) ... [2024-11-17 00:28:58,262 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-17 00:28:58,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:28:58,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:28:58,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:28:58,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:28:58,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,304 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 13, 16]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 3, 8]. [2024-11-17 00:28:58,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:28:58,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:28:58,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:28:58,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:28:58,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (1/1) ... [2024-11-17 00:28:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:28:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:28:58,357 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:28:58,359 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:28:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:28:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:28:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:28:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:28:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:28:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:28:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:28:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:28:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:28:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:28:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:28:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:28:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:28:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:28:58,519 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:28:58,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:28:58,882 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-17 00:28:58,882 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:28:58,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:28:58,899 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:28:58,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:28:58 BoogieIcfgContainer [2024-11-17 00:28:58,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:28:58,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:28:58,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:28:58,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:28:58,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:28:57" (1/3) ... [2024-11-17 00:28:58,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194f0187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:28:58, skipping insertion in model container [2024-11-17 00:28:58,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:28:58" (2/3) ... [2024-11-17 00:28:58,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194f0187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:28:58, skipping insertion in model container [2024-11-17 00:28:58,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:28:58" (3/3) ... [2024-11-17 00:28:58,908 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2024-11-17 00:28:58,926 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:28:58,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-17 00:28:58,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:28:58,972 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;@448e1ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:28:58,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-17 00:28:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 74 states have (on average 2.027027027027027) internal successors, (150), 139 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:28:58,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:58,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:28:58,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:28:58,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash 180693, now seen corresponding path program 1 times [2024-11-17 00:28:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405259265] [2024-11-17 00:28:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:59,253 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:28:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405259265] [2024-11-17 00:28:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405259265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:59,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747993286] [2024-11-17 00:28:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:59,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:59,287 INFO L87 Difference]: Start difference. First operand has 140 states, 74 states have (on average 2.027027027027027) internal successors, (150), 139 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:59,422 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2024-11-17 00:28:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:28:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:59,430 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:28:59,431 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:28:59,432 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:28:59,435 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:59,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 175 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:28:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 00:28:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2024-11-17 00:28:59,463 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 3 [2024-11-17 00:28:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:59,464 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2024-11-17 00:28:59,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2024-11-17 00:28:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:28:59,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:59,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:28:59,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:28:59,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:28:59,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash 180694, now seen corresponding path program 1 times [2024-11-17 00:28:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508885069] [2024-11-17 00:28:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:59,545 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:28:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508885069] [2024-11-17 00:28:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508885069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:59,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:28:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270532994] [2024-11-17 00:28:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:28:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:28:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:28:59,550 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:59,647 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2024-11-17 00:28:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:28:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:28:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:59,651 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:28:59,651 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:28:59,651 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:28:59,652 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:59,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 178 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:59,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:28:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-17 00:28:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2024-11-17 00:28:59,662 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 3 [2024-11-17 00:28:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:59,662 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2024-11-17 00:28:59,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2024-11-17 00:28:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:28:59,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:28:59,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:28:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:28:59,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:28:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:28:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2129002631, now seen corresponding path program 1 times [2024-11-17 00:28:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:28:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997203025] [2024-11-17 00:28:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:28:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:28:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:28:59,835 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:28:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:28:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997203025] [2024-11-17 00:28:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997203025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:28:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:28:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:28:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224079295] [2024-11-17 00:28:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:28:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:28:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:28:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:28:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:28:59,839 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:28:59,985 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2024-11-17 00:28:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:28:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:28:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:28:59,987 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:28:59,987 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:28:59,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:28:59,990 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 16 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:28:59,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 297 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:28:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:28:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-17 00:28:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 121 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2024-11-17 00:28:59,998 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 10 [2024-11-17 00:28:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:28:59,999 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2024-11-17 00:28:59,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:28:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2024-11-17 00:29:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:29:00,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:00,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:00,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:29:00,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2129002630, now seen corresponding path program 1 times [2024-11-17 00:29:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178698542] [2024-11-17 00:29:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:00,302 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:29:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178698542] [2024-11-17 00:29:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178698542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:00,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:00,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070800080] [2024-11-17 00:29:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:00,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:00,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:00,304 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:00,464 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2024-11-17 00:29:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:29:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:00,465 INFO L225 Difference]: With dead ends: 121 [2024-11-17 00:29:00,465 INFO L226 Difference]: Without dead ends: 121 [2024-11-17 00:29:00,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:00,466 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 32 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:00,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 284 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-17 00:29:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-17 00:29:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 120 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2024-11-17 00:29:00,478 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 10 [2024-11-17 00:29:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2024-11-17 00:29:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2024-11-17 00:29:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:29:00,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:00,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:00,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:29:00,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:00,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1574572023, now seen corresponding path program 1 times [2024-11-17 00:29:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:00,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729624521] [2024-11-17 00:29:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:00,562 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:29:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729624521] [2024-11-17 00:29:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729624521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:00,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832031585] [2024-11-17 00:29:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:00,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:00,564 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:00,686 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2024-11-17 00:29:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:29:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:00,687 INFO L225 Difference]: With dead ends: 120 [2024-11-17 00:29:00,687 INFO L226 Difference]: Without dead ends: 120 [2024-11-17 00:29:00,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:00,689 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:00,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 407 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-17 00:29:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-17 00:29:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.75) internal successors, (126), 119 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2024-11-17 00:29:00,693 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 11 [2024-11-17 00:29:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:00,694 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2024-11-17 00:29:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2024-11-17 00:29:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:29:00,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:00,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:00,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:29:00,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1574572022, now seen corresponding path program 1 times [2024-11-17 00:29:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965869183] [2024-11-17 00:29:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:00,934 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:29:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:00,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965869183] [2024-11-17 00:29:00,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965869183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:00,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513789716] [2024-11-17 00:29:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:00,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:00,937 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:01,125 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2024-11-17 00:29:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:29:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:01,126 INFO L225 Difference]: With dead ends: 119 [2024-11-17 00:29:01,129 INFO L226 Difference]: Without dead ends: 119 [2024-11-17 00:29:01,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:29:01,130 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 18 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:01,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 325 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-17 00:29:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-17 00:29:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.7361111111111112) internal successors, (125), 118 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2024-11-17 00:29:01,138 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 11 [2024-11-17 00:29:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2024-11-17 00:29:01,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2024-11-17 00:29:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:29:01,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:01,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:29:01,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:01,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1046104003, now seen corresponding path program 1 times [2024-11-17 00:29:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:01,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561434702] [2024-11-17 00:29:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:01,223 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:29:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561434702] [2024-11-17 00:29:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561434702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735977485] [2024-11-17 00:29:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:01,227 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:01,330 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2024-11-17 00:29:01,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:01,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:29:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:01,331 INFO L225 Difference]: With dead ends: 118 [2024-11-17 00:29:01,331 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 00:29:01,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:01,332 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:01,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 293 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 00:29:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-17 00:29:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 117 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2024-11-17 00:29:01,341 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 15 [2024-11-17 00:29:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:01,341 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2024-11-17 00:29:01,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2024-11-17 00:29:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:29:01,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:01,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:01,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:29:01,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1046104004, now seen corresponding path program 1 times [2024-11-17 00:29:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:01,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031828311] [2024-11-17 00:29:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:01,491 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:29:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031828311] [2024-11-17 00:29:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031828311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:01,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367173493] [2024-11-17 00:29:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:01,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:01,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:01,493 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:01,594 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-17 00:29:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:29:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:01,595 INFO L225 Difference]: With dead ends: 117 [2024-11-17 00:29:01,595 INFO L226 Difference]: Without dead ends: 117 [2024-11-17 00:29:01,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:01,596 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:01,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 314 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-17 00:29:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-17 00:29:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 116 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-11-17 00:29:01,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 15 [2024-11-17 00:29:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-11-17 00:29:01,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-11-17 00:29:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:29:01,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:01,600 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:29:01,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:29:01,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:01,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1930514190, now seen corresponding path program 1 times [2024-11-17 00:29:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527429322] [2024-11-17 00:29:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:01,647 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:29:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:01,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527429322] [2024-11-17 00:29:01,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527429322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:01,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:01,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554259987] [2024-11-17 00:29:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:01,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:01,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:01,649 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:01,719 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-17 00:29:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:29:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:01,720 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:29:01,720 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:29:01,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:01,721 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:01,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 396 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:29:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-17 00:29:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 115 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2024-11-17 00:29:01,723 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 16 [2024-11-17 00:29:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:01,724 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2024-11-17 00:29:01,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2024-11-17 00:29:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:29:01,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:01,724 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:29:01,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:29:01,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1930514189, now seen corresponding path program 1 times [2024-11-17 00:29:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480620030] [2024-11-17 00:29:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:01,862 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:29:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480620030] [2024-11-17 00:29:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480620030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:01,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:01,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:29:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081513359] [2024-11-17 00:29:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:01,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:29:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:29:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:01,864 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:29:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:02,020 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2024-11-17 00:29:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:02,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:29:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:02,021 INFO L225 Difference]: With dead ends: 115 [2024-11-17 00:29:02,021 INFO L226 Difference]: Without dead ends: 115 [2024-11-17 00:29:02,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:02,022 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 6 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:02,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 379 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-17 00:29:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-17 00:29:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2024-11-17 00:29:02,024 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 16 [2024-11-17 00:29:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:02,024 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2024-11-17 00:29:02,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:29:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2024-11-17 00:29:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:29:02,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:02,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:29:02,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1316636986, now seen corresponding path program 1 times [2024-11-17 00:29:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285779205] [2024-11-17 00:29:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:02,095 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:29:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285779205] [2024-11-17 00:29:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285779205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711056968] [2024-11-17 00:29:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:02,097 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:02,220 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2024-11-17 00:29:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:02,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:29:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:02,221 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:29:02,221 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:29:02,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:02,222 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:02,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 234 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:29:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-17 00:29:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2024-11-17 00:29:02,224 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 21 [2024-11-17 00:29:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2024-11-17 00:29:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2024-11-17 00:29:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:29:02,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:02,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:29:02,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1316636987, now seen corresponding path program 1 times [2024-11-17 00:29:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197671713] [2024-11-17 00:29:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:02,330 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:29:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197671713] [2024-11-17 00:29:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197671713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:29:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877687427] [2024-11-17 00:29:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:02,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:29:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:29:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:02,332 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:02,462 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2024-11-17 00:29:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:29:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:02,463 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:29:02,463 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:29:02,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:02,464 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:02,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 335 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:29:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:29:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.625) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2024-11-17 00:29:02,466 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 21 [2024-11-17 00:29:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:02,466 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2024-11-17 00:29:02,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2024-11-17 00:29:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:29:02,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:02,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:29:02,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1727327653, now seen corresponding path program 1 times [2024-11-17 00:29:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269201624] [2024-11-17 00:29:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:02,524 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:29:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269201624] [2024-11-17 00:29:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269201624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:02,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551838902] [2024-11-17 00:29:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:02,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:02,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:02,526 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:02,697 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-11-17 00:29:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:29:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:02,697 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:29:02,698 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:29:02,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:02,698 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 80 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:02,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 210 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:29:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-17 00:29:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 108 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:29:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-11-17 00:29:02,701 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 23 [2024-11-17 00:29:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-17 00:29:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-17 00:29:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:29:02,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:02,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:29:02,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1727327652, now seen corresponding path program 1 times [2024-11-17 00:29:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:02,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034179125] [2024-11-17 00:29:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034179125] [2024-11-17 00:29:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034179125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:02,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:29:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231921406] [2024-11-17 00:29:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:02,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:29:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:29:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:02,804 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:02,913 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-17 00:29:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:02,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:29:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:02,914 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:29:02,914 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:29:02,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:02,915 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 77 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:02,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 233 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:29:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-17 00:29:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 103 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2024-11-17 00:29:02,917 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 23 [2024-11-17 00:29:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:02,917 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2024-11-17 00:29:02,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2024-11-17 00:29:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:29:02,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:02,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:02,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:29:02,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2003793013, now seen corresponding path program 1 times [2024-11-17 00:29:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782705065] [2024-11-17 00:29:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:03,050 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:29:03,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782705065] [2024-11-17 00:29:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782705065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:29:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667566884] [2024-11-17 00:29:03,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:03,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:29:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:29:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:03,051 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:03,238 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-17 00:29:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:29:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:29:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:03,239 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:29:03,239 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:29:03,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:29:03,240 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 154 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:03,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 309 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:29:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-17 00:29:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 101 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2024-11-17 00:29:03,244 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 24 [2024-11-17 00:29:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:03,245 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2024-11-17 00:29:03,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-17 00:29:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:29:03,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:03,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:03,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:29:03,247 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2003793012, now seen corresponding path program 1 times [2024-11-17 00:29:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969903716] [2024-11-17 00:29:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:03,652 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:29:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:03,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969903716] [2024-11-17 00:29:03,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969903716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:03,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:03,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 00:29:03,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098227611] [2024-11-17 00:29:03,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:29:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:03,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:29:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:29:03,654 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:03,916 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2024-11-17 00:29:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:29:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:29:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:03,917 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:29:03,918 INFO L226 Difference]: Without dead ends: 140 [2024-11-17 00:29:03,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:29:03,918 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 237 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:03,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 434 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-17 00:29:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-17 00:29:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 126 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-11-17 00:29:03,921 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 24 [2024-11-17 00:29:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:03,921 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-11-17 00:29:03,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-11-17 00:29:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:29:03,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:03,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:03,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:29:03,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:03,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -814933913, now seen corresponding path program 1 times [2024-11-17 00:29:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387422204] [2024-11-17 00:29:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:04,025 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:29:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387422204] [2024-11-17 00:29:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387422204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298691972] [2024-11-17 00:29:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:04,030 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:04,141 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2024-11-17 00:29:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:29:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:04,144 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:29:04,144 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:29:04,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:04,144 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 73 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:04,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 316 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:29:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 00:29:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 125 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2024-11-17 00:29:04,148 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 26 [2024-11-17 00:29:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2024-11-17 00:29:04,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2024-11-17 00:29:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:29:04,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:04,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:04,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:29:04,151 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1465903098, now seen corresponding path program 1 times [2024-11-17 00:29:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959591774] [2024-11-17 00:29:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:04,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:29:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959591774] [2024-11-17 00:29:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959591774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211774175] [2024-11-17 00:29:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:04,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:04,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:04,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:04,261 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:04,411 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2024-11-17 00:29:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:29:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-17 00:29:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:04,412 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:29:04,412 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:29:04,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:04,412 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 58 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:04,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 328 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:29:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-11-17 00:29:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.471698113207547) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2024-11-17 00:29:04,416 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 28 [2024-11-17 00:29:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:04,416 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2024-11-17 00:29:04,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2024-11-17 00:29:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:29:04,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:04,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:04,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:29:04,418 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:04,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1465903097, now seen corresponding path program 1 times [2024-11-17 00:29:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607405182] [2024-11-17 00:29:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:04,701 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:29:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607405182] [2024-11-17 00:29:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607405182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:29:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633706975] [2024-11-17 00:29:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:29:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:29:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:29:04,703 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:04,963 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-11-17 00:29:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:29:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-17 00:29:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:04,964 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:29:04,964 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:29:04,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:29:04,965 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 60 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:04,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 549 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:29:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-17 00:29:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2024-11-17 00:29:04,967 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 28 [2024-11-17 00:29:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:04,968 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2024-11-17 00:29:04,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2024-11-17 00:29:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:29:04,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:04,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:04,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:29:04,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1869982015, now seen corresponding path program 1 times [2024-11-17 00:29:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012041122] [2024-11-17 00:29:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:05,082 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:29:05,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012041122] [2024-11-17 00:29:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012041122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:29:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646765505] [2024-11-17 00:29:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:05,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:05,084 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:05,152 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2024-11-17 00:29:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:29:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-17 00:29:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:05,153 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:29:05,153 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:29:05,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:05,154 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:05,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 522 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:29:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-11-17 00:29:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 130 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2024-11-17 00:29:05,156 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 31 [2024-11-17 00:29:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:05,156 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2024-11-17 00:29:05,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2024-11-17 00:29:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:29:05,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:05,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:05,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:29:05,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash 508264239, now seen corresponding path program 1 times [2024-11-17 00:29:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394712343] [2024-11-17 00:29:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:05,331 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:29:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394712343] [2024-11-17 00:29:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394712343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:05,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:29:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668243037] [2024-11-17 00:29:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:29:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:29:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:05,333 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:05,414 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2024-11-17 00:29:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:29:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-17 00:29:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:05,415 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:29:05,415 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:29:05,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:29:05,415 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:05,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 600 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:29:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 00:29:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 133 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-17 00:29:05,418 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 31 [2024-11-17 00:29:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:05,418 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-17 00:29:05,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-17 00:29:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:29:05,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:05,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:05,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:29:05,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 144166475, now seen corresponding path program 1 times [2024-11-17 00:29:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312220835] [2024-11-17 00:29:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:05,461 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:29:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312220835] [2024-11-17 00:29:05,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312220835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:05,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:05,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:29:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450134128] [2024-11-17 00:29:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:29:05,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:29:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:29:05,463 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:05,542 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2024-11-17 00:29:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:05,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-17 00:29:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:05,543 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:29:05,543 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 00:29:05,543 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:29:05,544 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 48 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:05,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 134 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 00:29:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2024-11-17 00:29:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-17 00:29:05,547 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 31 [2024-11-17 00:29:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:05,548 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-17 00:29:05,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-17 00:29:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:29:05,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:05,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:29:05,549 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:05,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 144166476, now seen corresponding path program 1 times [2024-11-17 00:29:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677618147] [2024-11-17 00:29:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:05,896 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:29:05,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:05,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677618147] [2024-11-17 00:29:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677618147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 00:29:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125631034] [2024-11-17 00:29:05,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:05,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:29:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:05,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:29:05,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:29:05,898 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:06,227 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2024-11-17 00:29:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:29:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-17 00:29:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:06,228 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:29:06,228 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:29:06,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:29:06,229 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 251 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:06,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 497 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:29:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-17 00:29:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.38135593220339) internal successors, (163), 139 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2024-11-17 00:29:06,233 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 31 [2024-11-17 00:29:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:06,233 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2024-11-17 00:29:06,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2024-11-17 00:29:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:29:06,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:06,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:29:06,234 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1423677789, now seen corresponding path program 1 times [2024-11-17 00:29:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199424860] [2024-11-17 00:29:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:06,401 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:29:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199424860] [2024-11-17 00:29:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199424860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:29:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890650720] [2024-11-17 00:29:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:29:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:29:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:06,402 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:06,523 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2024-11-17 00:29:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:29:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-17 00:29:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:06,524 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:29:06,524 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 00:29:06,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:29:06,524 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 58 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:06,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 520 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 00:29:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-17 00:29:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 140 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2024-11-17 00:29:06,527 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 32 [2024-11-17 00:29:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:06,527 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2024-11-17 00:29:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2024-11-17 00:29:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:29:06,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:06,528 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:29:06,528 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 175180133, now seen corresponding path program 1 times [2024-11-17 00:29:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924882670] [2024-11-17 00:29:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924882670] [2024-11-17 00:29:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924882670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667615643] [2024-11-17 00:29:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:07,543 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:29:07,547 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:29:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:07,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-17 00:29:07,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:07,719 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:29:07,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:07,770 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:29:07,799 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:07,799 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 15 treesize of output 15 [2024-11-17 00:29:07,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-17 00:29:07,833 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:29:07,939 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 31 treesize of output 23 [2024-11-17 00:29:07,945 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 31 treesize of output 23 [2024-11-17 00:29:08,074 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 44 treesize of output 27 [2024-11-17 00:29:08,081 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 44 treesize of output 27 [2024-11-17 00:29:08,092 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 44 treesize of output 27 [2024-11-17 00:29:08,097 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 44 treesize of output 27 [2024-11-17 00:29:08,330 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 41 treesize of output 13 [2024-11-17 00:29:08,334 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 41 treesize of output 13 [2024-11-17 00:29:08,399 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:29:08,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:08,403 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 33 treesize of output 11 [2024-11-17 00:29:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:08,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:29:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667615643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:08,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:29:08,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2024-11-17 00:29:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489980164] [2024-11-17 00:29:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:08,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:29:08,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:08,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:29:08,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2024-11-17 00:29:08,459 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:09,137 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2024-11-17 00:29:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:29:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-17 00:29:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:09,138 INFO L225 Difference]: With dead ends: 179 [2024-11-17 00:29:09,138 INFO L226 Difference]: Without dead ends: 179 [2024-11-17 00:29:09,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:29:09,140 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 66 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:09,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 805 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-17 00:29:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2024-11-17 00:29:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.353846153846154) internal successors, (176), 151 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:29:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2024-11-17 00:29:09,142 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 32 [2024-11-17 00:29:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:09,142 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2024-11-17 00:29:09,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2024-11-17 00:29:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:29:09,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:09,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:09,157 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:29:09,343 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,SelfDestructingSolverStorable24 [2024-11-17 00:29:09,344 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:09,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1184338515, now seen corresponding path program 1 times [2024-11-17 00:29:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800220558] [2024-11-17 00:29:09,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:09,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:09,406 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:29:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800220558] [2024-11-17 00:29:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800220558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562245674] [2024-11-17 00:29:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:09,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:09,408 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:09,499 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-11-17 00:29:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 00:29:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:09,500 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:29:09,500 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:29:09,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:09,501 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 6 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:09,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 363 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:29:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-17 00:29:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 150 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2024-11-17 00:29:09,503 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 33 [2024-11-17 00:29:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:09,504 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2024-11-17 00:29:09,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2024-11-17 00:29:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:29:09,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:09,504 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:29:09,505 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash 527620223, now seen corresponding path program 1 times [2024-11-17 00:29:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561835320] [2024-11-17 00:29:09,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561835320] [2024-11-17 00:29:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561835320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968320413] [2024-11-17 00:29:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:09,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:09,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:09,773 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:29:09,774 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:29:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:09,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:29:09,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:09,909 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:29:09,915 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:29:09,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-17 00:29:09,983 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:29:10,016 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:29:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:10,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:10,086 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:29:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:10,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968320413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:10,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:10,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2024-11-17 00:29:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485141741] [2024-11-17 00:29:10,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:29:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:29:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:29:10,123 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 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:29:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:10,338 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2024-11-17 00:29:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:29:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 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 36 [2024-11-17 00:29:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:10,339 INFO L225 Difference]: With dead ends: 155 [2024-11-17 00:29:10,339 INFO L226 Difference]: Without dead ends: 155 [2024-11-17 00:29:10,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:29:10,339 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 74 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:10,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 347 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-17 00:29:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-17 00:29:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.335820895522388) internal successors, (179), 154 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2024-11-17 00:29:10,342 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 36 [2024-11-17 00:29:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2024-11-17 00:29:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 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:29:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2024-11-17 00:29:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:29:10,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:10,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:10,356 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:29:10,545 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,SelfDestructingSolverStorable26 [2024-11-17 00:29:10,545 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1536518809, now seen corresponding path program 1 times [2024-11-17 00:29:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397389700] [2024-11-17 00:29:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:10,992 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:29:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397389700] [2024-11-17 00:29:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397389700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 00:29:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438597617] [2024-11-17 00:29:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:29:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:29:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:29:10,994 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 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:29:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:11,359 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2024-11-17 00:29:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:29:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 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:29:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:11,360 INFO L225 Difference]: With dead ends: 172 [2024-11-17 00:29:11,360 INFO L226 Difference]: Without dead ends: 172 [2024-11-17 00:29:11,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:29:11,361 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 273 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:11,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 529 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-17 00:29:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2024-11-17 00:29:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2024-11-17 00:29:11,363 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 37 [2024-11-17 00:29:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:11,363 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2024-11-17 00:29:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 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:29:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2024-11-17 00:29:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:29:11,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:11,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:11,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-17 00:29:11,364 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:11,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash -387442824, now seen corresponding path program 1 times [2024-11-17 00:29:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089231426] [2024-11-17 00:29:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:11,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:11,427 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:29:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089231426] [2024-11-17 00:29:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089231426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:29:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092449233] [2024-11-17 00:29:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:29:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:29:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:11,429 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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:29:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:11,493 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2024-11-17 00:29:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:29:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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 38 [2024-11-17 00:29:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:11,494 INFO L225 Difference]: With dead ends: 159 [2024-11-17 00:29:11,494 INFO L226 Difference]: Without dead ends: 159 [2024-11-17 00:29:11,494 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:29:11,495 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:11,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 131 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-17 00:29:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-17 00:29:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2024-11-17 00:29:11,497 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 38 [2024-11-17 00:29:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2024-11-17 00:29:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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:29:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2024-11-17 00:29:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:29:11,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:11,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:11,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 00:29:11,498 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:11,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash -387442823, now seen corresponding path program 1 times [2024-11-17 00:29:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908456029] [2024-11-17 00:29:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:11,549 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:29:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908456029] [2024-11-17 00:29:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908456029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:29:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704870271] [2024-11-17 00:29:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:29:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:29:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:11,551 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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:29:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:11,598 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2024-11-17 00:29:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:29:11,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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 38 [2024-11-17 00:29:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:11,600 INFO L225 Difference]: With dead ends: 157 [2024-11-17 00:29:11,600 INFO L226 Difference]: Without dead ends: 157 [2024-11-17 00:29:11,600 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:29:11,600 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:11,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:29:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-17 00:29:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-17 00:29:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.2661870503597121) 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:29:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2024-11-17 00:29:11,603 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 38 [2024-11-17 00:29:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:11,603 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2024-11-17 00:29:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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:29:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2024-11-17 00:29:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:29:11,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:11,604 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 00:29:11,604 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:11,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 875162022, now seen corresponding path program 1 times [2024-11-17 00:29:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154903281] [2024-11-17 00:29:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154903281] [2024-11-17 00:29:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154903281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536655926] [2024-11-17 00:29:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:12,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:12,213 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:29:12,221 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:29:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:12,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-17 00:29:12,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:12,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:12,368 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:29:12,381 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:29:12,395 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:12,395 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 15 treesize of output 15 [2024-11-17 00:29:12,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-17 00:29:12,442 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 13 treesize of output 9 [2024-11-17 00:29:12,618 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 29 treesize of output 21 [2024-11-17 00:29:12,635 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 23 treesize of output 15 [2024-11-17 00:29:12,692 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 61 treesize of output 25 [2024-11-17 00:29:12,697 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 33 [2024-11-17 00:29:12,849 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 42 treesize of output 25 [2024-11-17 00:29:12,861 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 50 treesize of output 27 [2024-11-17 00:29:12,873 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 42 treesize of output 25 [2024-11-17 00:29:12,878 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 50 treesize of output 27 [2024-11-17 00:29:13,207 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 81 treesize of output 43 [2024-11-17 00:29:13,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:13,221 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 49 treesize of output 27 [2024-11-17 00:29:13,568 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 38 treesize of output 14 [2024-11-17 00:29:13,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:13,573 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 17 treesize of output 7 [2024-11-17 00:29:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:13,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:29:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536655926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:29:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [22] total 45 [2024-11-17 00:29:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158345386] [2024-11-17 00:29:13,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:13,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:29:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:29:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1837, Unknown=0, NotChecked=0, Total=1980 [2024-11-17 00:29:13,647 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand has 26 states, 26 states have (on average 1.5) internal successors, (39), 26 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:29:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:15,054 INFO L93 Difference]: Finished difference Result 171 states and 191 transitions. [2024-11-17 00:29:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:29:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5) internal successors, (39), 26 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 39 [2024-11-17 00:29:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:15,055 INFO L225 Difference]: With dead ends: 171 [2024-11-17 00:29:15,055 INFO L226 Difference]: Without dead ends: 171 [2024-11-17 00:29:15,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=342, Invalid=3948, Unknown=0, NotChecked=0, Total=4290 [2024-11-17 00:29:15,057 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 71 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:15,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 908 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:29:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-17 00:29:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2024-11-17 00:29:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 165 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2024-11-17 00:29:15,062 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 39 [2024-11-17 00:29:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:15,062 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2024-11-17 00:29:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5) internal successors, (39), 26 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:29:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2024-11-17 00:29:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:29:15,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:15,063 INFO L215 NwaCegarLoop]: trace histogram [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:29:15,076 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:29:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:15,267 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:15,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 663914594, now seen corresponding path program 1 times [2024-11-17 00:29:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005645152] [2024-11-17 00:29:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:15,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005645152] [2024-11-17 00:29:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005645152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128696779] [2024-11-17 00:29:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:15,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:15,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:15,958 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:29:15,959 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:29:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:16,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-17 00:29:16,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:16,099 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:29:16,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:16,136 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:29:16,139 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:29:16,168 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:16,168 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 15 treesize of output 15 [2024-11-17 00:29:16,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:29:16,205 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 18 [2024-11-17 00:29:16,371 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 25 treesize of output 17 [2024-11-17 00:29:16,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:16,417 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 49 treesize of output 21 [2024-11-17 00:29:16,560 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 38 treesize of output 21 [2024-11-17 00:29:16,610 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 38 treesize of output 21 [2024-11-17 00:29:16,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:29:16,958 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 29 treesize of output 13 [2024-11-17 00:29:17,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:17,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-17 00:29:17,109 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 20 treesize of output 15 [2024-11-17 00:29:17,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:17,163 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 32 treesize of output 12 [2024-11-17 00:29:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:17,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:17,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:17,691 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 49 treesize of output 53 [2024-11-17 00:29:18,014 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-17 00:29:18,014 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 2 case distinctions, treesize of input 51 treesize of output 56 [2024-11-17 00:29:18,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:18,022 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 77 treesize of output 80 [2024-11-17 00:29:18,026 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 48 treesize of output 46 [2024-11-17 00:29:18,066 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-17 00:29:18,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-17 00:29:18,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:29:18,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-17 00:29:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128696779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:18,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 68 [2024-11-17 00:29:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618703943] [2024-11-17 00:29:18,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-17 00:29:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-17 00:29:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=4396, Unknown=9, NotChecked=0, Total=4692 [2024-11-17 00:29:18,434 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand has 69 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:19,712 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2024-11-17 00:29:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:29:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 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:29:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:19,713 INFO L225 Difference]: With dead ends: 194 [2024-11-17 00:29:19,713 INFO L226 Difference]: Without dead ends: 194 [2024-11-17 00:29:19,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=465, Invalid=6006, Unknown=9, NotChecked=0, Total=6480 [2024-11-17 00:29:19,715 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:19,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1561 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:29:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-17 00:29:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2024-11-17 00:29:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 186 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2024-11-17 00:29:19,717 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 41 [2024-11-17 00:29:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:19,717 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2024-11-17 00:29:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2024-11-17 00:29:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:29:19,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:19,718 INFO L215 NwaCegarLoop]: trace histogram [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:29:19,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:29:19,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:19,922 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 663914595, now seen corresponding path program 1 times [2024-11-17 00:29:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:19,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376123815] [2024-11-17 00:29:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376123815] [2024-11-17 00:29:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376123815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3754713] [2024-11-17 00:29:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:20,704 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:29:20,709 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:29:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:20,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-17 00:29:20,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:20,847 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:29:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:20,884 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:29:20,889 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:29:20,918 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:29:20,927 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:20,927 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 15 treesize of output 15 [2024-11-17 00:29:20,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-17 00:29:20,966 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 18 [2024-11-17 00:29:21,165 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 19 treesize of output 11 [2024-11-17 00:29:21,174 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 25 treesize of output 17 [2024-11-17 00:29:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:21,229 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 49 treesize of output 21 [2024-11-17 00:29:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:21,235 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 33 treesize of output 28 [2024-11-17 00:29:21,491 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 38 treesize of output 21 [2024-11-17 00:29:21,502 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 45 treesize of output 22 [2024-11-17 00:29:21,525 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 45 treesize of output 22 [2024-11-17 00:29:21,537 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 38 treesize of output 21 [2024-11-17 00:29:22,143 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 29 treesize of output 13 [2024-11-17 00:29:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:22,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 7 [2024-11-17 00:29:22,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:22,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-17 00:29:22,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2024-11-17 00:29:22,354 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 32 treesize of output 12 [2024-11-17 00:29:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:22,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:23,396 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-17 00:29:23,396 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 2 case distinctions, treesize of input 93 treesize of output 98 [2024-11-17 00:29:23,413 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-17 00:29:23,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-11-17 00:29:23,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:23,426 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 108 treesize of output 111 [2024-11-17 00:29:23,477 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-17 00:29:23,479 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 160 treesize of output 166 [2024-11-17 00:29:23,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-17 00:29:23,503 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 9 treesize of output 7 [2024-11-17 00:29:23,649 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-17 00:29:23,650 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 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-17 00:29:23,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:29:23,668 INFO L349 Elim1Store]: treesize reduction 42, result has 8.7 percent of original size [2024-11-17 00:29:23,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 18 [2024-11-17 00:29:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3754713] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:24,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:24,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 24] total 65 [2024-11-17 00:29:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941003345] [2024-11-17 00:29:24,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-17 00:29:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-17 00:29:24,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4021, Unknown=15, NotChecked=0, Total=4290 [2024-11-17 00:29:24,269 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand has 66 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 66 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:26,373 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2024-11-17 00:29:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:29:26,373 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 66 states have internal predecessors, (121), 0 states have call successors, (0), 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:29:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:26,374 INFO L225 Difference]: With dead ends: 193 [2024-11-17 00:29:26,374 INFO L226 Difference]: Without dead ends: 193 [2024-11-17 00:29:26,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=483, Invalid=6642, Unknown=15, NotChecked=0, Total=7140 [2024-11-17 00:29:26,376 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 87 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:26,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1671 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:29:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-17 00:29:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2024-11-17 00:29:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.223529411764706) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2024-11-17 00:29:26,378 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 41 [2024-11-17 00:29:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:26,378 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2024-11-17 00:29:26,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 66 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2024-11-17 00:29:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:29:26,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:26,379 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:29:26,392 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:29:26,583 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,SelfDestructingSolverStorable32 [2024-11-17 00:29:26,584 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:26,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1716980579, now seen corresponding path program 1 times [2024-11-17 00:29:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759250192] [2024-11-17 00:29:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759250192] [2024-11-17 00:29:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759250192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415124134] [2024-11-17 00:29:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:27,114 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:29:27,115 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:29:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:27,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-17 00:29:27,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:27,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:27,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:29:27,293 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:29:27,298 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:29:27,325 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:27,326 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-17 00:29:27,356 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 28 treesize of output 16 [2024-11-17 00:29:27,360 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:29:27,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-17 00:29:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:27,584 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 47 treesize of output 19 [2024-11-17 00:29:27,716 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 32 treesize of output 19 [2024-11-17 00:29:27,757 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 32 treesize of output 19 [2024-11-17 00:29:28,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:28,066 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 22 treesize of output 18 [2024-11-17 00:29:28,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:28,131 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 27 treesize of output 31 [2024-11-17 00:29:28,215 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-17 00:29:28,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 64 treesize of output 63 [2024-11-17 00:29:28,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:28,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 45 [2024-11-17 00:29:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:28,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:29,401 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-17 00:29:29,401 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 2 case distinctions, treesize of input 47 treesize of output 52 [2024-11-17 00:29:29,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:29,409 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 69 treesize of output 72 [2024-11-17 00:29:29,412 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 40 treesize of output 38 [2024-11-17 00:29:29,899 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 14 [2024-11-17 00:29:29,901 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 118 treesize of output 114 [2024-11-17 00:29:29,909 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 14 [2024-11-17 00:29:29,912 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 89 treesize of output 85 [2024-11-17 00:29:29,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-17 00:29:29,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-17 00:29:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415124134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:30,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 27] total 71 [2024-11-17 00:29:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630405690] [2024-11-17 00:29:30,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-17 00:29:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-17 00:29:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4686, Unknown=11, NotChecked=0, Total=4970 [2024-11-17 00:29:30,010 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 71 states, 71 states have (on average 1.647887323943662) internal successors, (117), 71 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:31,653 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2024-11-17 00:29:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:29:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.647887323943662) internal successors, (117), 71 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:31,654 INFO L225 Difference]: With dead ends: 192 [2024-11-17 00:29:31,654 INFO L226 Difference]: Without dead ends: 192 [2024-11-17 00:29:31,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=531, Invalid=7648, Unknown=11, NotChecked=0, Total=8190 [2024-11-17 00:29:31,656 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 127 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:31,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 2439 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:29:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-17 00:29:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2024-11-17 00:29:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.2176470588235293) internal successors, (207), 186 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2024-11-17 00:29:31,659 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 44 [2024-11-17 00:29:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:31,659 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2024-11-17 00:29:31,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.647887323943662) internal successors, (117), 71 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2024-11-17 00:29:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:29:31,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:31,660 INFO L215 NwaCegarLoop]: trace histogram [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:29:31,678 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:29:31,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:31,864 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 355262803, now seen corresponding path program 1 times [2024-11-17 00:29:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760149657] [2024-11-17 00:29:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:32,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760149657] [2024-11-17 00:29:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760149657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301812538] [2024-11-17 00:29:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:32,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:32,422 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:29:32,426 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:29:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:32,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-17 00:29:32,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:32,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:32,594 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:29:32,621 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:29:32,625 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:29:32,655 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:32,655 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 15 treesize of output 15 [2024-11-17 00:29:32,686 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:29:32,691 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 18 [2024-11-17 00:29:32,866 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 19 treesize of output 11 [2024-11-17 00:29:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:32,923 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 47 treesize of output 34 [2024-11-17 00:29:33,118 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 61 treesize of output 32 [2024-11-17 00:29:33,134 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 61 treesize of output 32 [2024-11-17 00:29:33,519 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 62 treesize of output 36 [2024-11-17 00:29:33,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:33,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,612 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 36 treesize of output 16 [2024-11-17 00:29:33,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2024-11-17 00:29:33,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:33,848 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 37 treesize of output 13 [2024-11-17 00:29:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:33,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:34,748 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-17 00:29:34,749 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 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-17 00:29:34,768 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-17 00:29:34,768 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 64 treesize of output 78 [2024-11-17 00:29:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301812538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:35,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 26] total 69 [2024-11-17 00:29:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040076502] [2024-11-17 00:29:35,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:35,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-17 00:29:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-17 00:29:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=4532, Unknown=13, NotChecked=0, Total=4830 [2024-11-17 00:29:35,165 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 70 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:36,725 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2024-11-17 00:29:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:29:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 70 states have internal predecessors, (124), 0 states have call successors, (0), 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:29:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:36,726 INFO L225 Difference]: With dead ends: 194 [2024-11-17 00:29:36,726 INFO L226 Difference]: Without dead ends: 194 [2024-11-17 00:29:36,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=575, Invalid=7422, Unknown=13, NotChecked=0, Total=8010 [2024-11-17 00:29:36,728 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:36,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2241 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:29:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-17 00:29:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2024-11-17 00:29:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.2138728323699421) internal successors, (210), 189 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2024-11-17 00:29:36,731 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 44 [2024-11-17 00:29:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2024-11-17 00:29:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 70 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2024-11-17 00:29:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:29:36,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:36,731 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 00:29:36,745 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:29:36,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:36,936 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1871755009, now seen corresponding path program 1 times [2024-11-17 00:29:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673679300] [2024-11-17 00:29:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:37,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673679300] [2024-11-17 00:29:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673679300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869144090] [2024-11-17 00:29:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:37,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:37,529 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:29:37,530 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:29:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:37,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-17 00:29:37,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:37,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:37,695 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:29:37,723 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:29:37,726 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:29:37,757 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:37,757 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 15 treesize of output 15 [2024-11-17 00:29:37,788 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 18 [2024-11-17 00:29:37,792 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:29:37,981 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 27 treesize of output 1 [2024-11-17 00:29:38,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:38,024 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 49 treesize of output 21 [2024-11-17 00:29:38,169 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 38 treesize of output 21 [2024-11-17 00:29:38,177 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 38 treesize of output 21 [2024-11-17 00:29:38,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:29:38,486 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 29 treesize of output 13 [2024-11-17 00:29:38,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:38,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2024-11-17 00:29:38,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:38,633 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 32 treesize of output 12 [2024-11-17 00:29:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:38,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:39,308 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-17 00:29:39,309 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 2 case distinctions, treesize of input 46 treesize of output 51 [2024-11-17 00:29:39,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:39,319 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 66 treesize of output 69 [2024-11-17 00:29:39,359 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 5 [2024-11-17 00:29:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869144090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:39,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 25] total 63 [2024-11-17 00:29:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351173473] [2024-11-17 00:29:39,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:39,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-17 00:29:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:39,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-17 00:29:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3744, Unknown=12, NotChecked=0, Total=4032 [2024-11-17 00:29:39,706 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 64 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:41,072 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2024-11-17 00:29:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:29:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 64 states have internal predecessors, (112), 0 states have call successors, (0), 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:29:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:41,073 INFO L225 Difference]: With dead ends: 195 [2024-11-17 00:29:41,074 INFO L226 Difference]: Without dead ends: 195 [2024-11-17 00:29:41,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=454, Invalid=5386, Unknown=12, NotChecked=0, Total=5852 [2024-11-17 00:29:41,075 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 100 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:41,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2370 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:29:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-17 00:29:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2024-11-17 00:29:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.2126436781609196) internal successors, (211), 190 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2024-11-17 00:29:41,077 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 45 [2024-11-17 00:29:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2024-11-17 00:29:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 64 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2024-11-17 00:29:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:29:41,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:41,078 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 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:29:41,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:41,278 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,SelfDestructingSolverStorable35 [2024-11-17 00:29:41,279 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -980603685, now seen corresponding path program 2 times [2024-11-17 00:29:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563926079] [2024-11-17 00:29:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563926079] [2024-11-17 00:29:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563926079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889864512] [2024-11-17 00:29:41,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:29:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:41,893 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:29:41,894 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:29:42,084 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:29:42,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:29:42,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-17 00:29:42,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:42,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:42,100 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:29:42,125 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:29:42,128 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:29:42,167 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-17 00:29:42,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-17 00:29:42,203 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:29:42,207 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 28 treesize of output 16 [2024-11-17 00:29:42,384 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 19 treesize of output 11 [2024-11-17 00:29:42,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:42,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 36 [2024-11-17 00:29:42,654 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 49 treesize of output 30 [2024-11-17 00:29:42,668 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 49 treesize of output 30 [2024-11-17 00:29:43,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:29:43,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:43,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 18 [2024-11-17 00:29:43,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-17 00:29:43,289 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 27 treesize of output 11 [2024-11-17 00:29:43,309 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:29:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:43,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:43,362 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:29:43,950 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-17 00:29:43,950 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 2 case distinctions, treesize of input 47 treesize of output 40 [2024-11-17 00:29:43,968 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-17 00:29:43,969 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 67 treesize of output 81 [2024-11-17 00:29:43,972 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 40 treesize of output 38 [2024-11-17 00:29:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889864512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:29:44,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:29:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 65 [2024-11-17 00:29:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750832389] [2024-11-17 00:29:44,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:29:44,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-17 00:29:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-17 00:29:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4001, Unknown=9, NotChecked=0, Total=4290 [2024-11-17 00:29:44,330 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 66 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 66 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:29:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:45,891 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2024-11-17 00:29:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:29:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 66 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 49 [2024-11-17 00:29:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:45,893 INFO L225 Difference]: With dead ends: 199 [2024-11-17 00:29:45,893 INFO L226 Difference]: Without dead ends: 199 [2024-11-17 00:29:45,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=501, Invalid=6296, Unknown=9, NotChecked=0, Total=6806 [2024-11-17 00:29:45,894 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 101 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:45,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 2128 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:29:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-17 00:29:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2024-11-17 00:29:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 179 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2024-11-17 00:29:45,896 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 49 [2024-11-17 00:29:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2024-11-17 00:29:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 66 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:29:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2024-11-17 00:29:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:29:45,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:45,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-17 00:29:45,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 00:29:46,100 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,SelfDestructingSolverStorable36 [2024-11-17 00:29:46,101 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:29:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 902466950, now seen corresponding path program 2 times [2024-11-17 00:29:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:46,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789973310] [2024-11-17 00:29:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789973310] [2024-11-17 00:29:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789973310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782429478] [2024-11-17 00:29:47,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:29:47,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:47,124 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:29:47,125 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:29:47,362 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:29:47,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:29:47,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 00:29:47,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:47,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-17 00:29:47,379 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:29:47,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:29:47,416 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:29:47,448 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:29:47,449 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 15 treesize of output 15 [2024-11-17 00:29:47,483 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 28 treesize of output 16 [2024-11-17 00:29:47,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 00:29:47,694 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 23 treesize of output 15 [2024-11-17 00:29:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:47,744 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 47 treesize of output 19 [2024-11-17 00:29:47,918 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 30 [2024-11-17 00:29:47,924 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 19 treesize of output 11 [2024-11-17 00:29:47,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 33 [2024-11-17 00:29:47,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:29:47,999 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 43 treesize of output 15 [2024-11-17 00:29:48,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:29:48,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 44 [2024-11-17 00:29:48,946 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2024-11-17 00:29:48,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2024-11-17 00:29:48,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:48,957 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 27 treesize of output 19 [2024-11-17 00:29:49,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:49,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:29:49,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2024-11-17 00:29:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:49,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:29:49,249 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:29:49,797 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 708 treesize of output 632 [2024-11-17 00:29:50,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:29:50,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:29:50,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 63857 treesize of output 61589 [2024-11-17 00:30:18,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:30:18,403 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 1186 treesize of output 1154 [2024-11-17 00:30:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782429478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:19,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:19,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 31] total 79 [2024-11-17 00:30:19,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464957487] [2024-11-17 00:30:19,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-17 00:30:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-17 00:30:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=5810, Unknown=0, NotChecked=0, Total=6162 [2024-11-17 00:30:19,006 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand has 79 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:20,639 INFO L93 Difference]: Finished difference Result 201 states and 221 transitions. [2024-11-17 00:30:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-17 00:30:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 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 54 [2024-11-17 00:30:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:20,645 INFO L225 Difference]: With dead ends: 201 [2024-11-17 00:30:20,645 INFO L226 Difference]: Without dead ends: 201 [2024-11-17 00:30:20,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=563, Invalid=8179, Unknown=0, NotChecked=0, Total=8742 [2024-11-17 00:30:20,646 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 73 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:20,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 2366 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:30:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-17 00:30:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2024-11-17 00:30:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 179 states have (on average 1.2067039106145252) internal successors, (216), 195 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2024-11-17 00:30:20,654 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 54 [2024-11-17 00:30:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2024-11-17 00:30:20,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2024-11-17 00:30:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:30:20,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:20,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 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:30:20,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:30:20,861 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,SelfDestructingSolverStorable37 [2024-11-17 00:30:20,862 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2024-11-17 00:30:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 259343295, now seen corresponding path program 2 times [2024-11-17 00:30:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977144035] [2024-11-17 00:30:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977144035] [2024-11-17 00:30:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977144035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053971747] [2024-11-17 00:30:23,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:30:23,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:23,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:23,005 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:30:23,006 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:30:23,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:30:23,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:30:23,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-17 00:30:23,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:23,277 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:30:23,279 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:30:23,460 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 207 treesize of output 159 [2024-11-17 00:30:23,483 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:30:24,039 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 23 treesize of output 15 [2024-11-17 00:30:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:30:24,171 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 47 treesize of output 19 [2024-11-17 00:30:24,606 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-17 00:30:24,607 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 32 treesize of output 31 [2024-11-17 00:30:24,615 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 9 treesize of output 7 [2024-11-17 00:30:24,810 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-17 00:30:24,810 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 32 treesize of output 31 [2024-11-17 00:30:24,818 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 9 treesize of output 7 [2024-11-17 00:30:26,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:26,218 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 22 treesize of output 18 [2024-11-17 00:30:26,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:26,414 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 27 treesize of output 31 [2024-11-17 00:30:26,611 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-17 00:30:26,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 242 treesize of output 165 [2024-11-17 00:30:27,050 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse0 (not .cse36)) (.cse1 (= 0 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.offset|))) (and (or .cse0 .cse1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (let ((.cse29 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse12 (select .cse43 4))) (let ((.cse31 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (.cse33 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse12)) (.cse28 (= |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| .cse12)) (.cse3 (not .cse29)) (.cse23 (select .cse43 |c_ULTIMATE.start_destroy_sl_~sl#1.offset|)) (.cse2 (select .cse43 0))) (let ((.cse10 (= .cse2 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (.cse22 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse23)) (.cse26 (select |c_#valid| .cse23)) (.cse20 (or .cse28 .cse3)) (.cse27 (= .cse23 .cse12)) (.cse9 (not .cse1)) (.cse13 (not .cse33)) (.cse16 (not .cse31)) (.cse14 (select |c_#valid| .cse12)) (.cse18 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|)))) (or (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse2) 0) .cse0 (let ((.cse25 (store |c_ULTIMATE.start_main_old_#valid#1| .cse2 1)) (.cse17 (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) (let ((.cse30 (= |c_#valid| (store .cse25 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| .cse17))) (.cse34 (= |c_#valid| (store .cse25 .cse12 .cse14))) (.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse2))) (let ((.cse4 (and (exists ((v_prenex_3 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_3) .cse2 1))) (and (= (select .cse35 .cse12) 0) (= (select .cse35 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_3)))) .cse34 .cse19)) (.cse5 (and .cse33 (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) .cse2 1) .cse12) 0)) .cse34)) (.cse7 (and .cse30 (exists ((v_prenex_3 Int)) (let ((.cse32 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_3) .cse2 1))) (and (= (select .cse32 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse32 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_3)))) .cse19)) (.cse8 (and .cse30 .cse31 (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) .cse2 1) |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0)))) (.cse6 (or .cse28 .cse29))) (or (and (or (and .cse3 (or .cse4 .cse5)) (and .cse6 (or .cse7 .cse8))) .cse9) (and (not .cse10) (let ((.cse15 (not .cse19)) (.cse11 (store .cse18 .cse2 1))) (or (and .cse3 (or .cse4 (and (= (select .cse11 .cse12) 0) .cse13 (= |c_#valid| (store .cse11 .cse12 .cse14)) .cse15) .cse5)) (and (or .cse7 (and (= (select .cse11 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) .cse16 .cse15 (= |c_#valid| (store .cse11 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| .cse17))) .cse8) .cse6)))) (and .cse20 (let ((.cse21 (= |c_#valid| (store .cse25 .cse23 .cse26)))) (or (and .cse21 .cse22 (exists ((v_DerPreprocessor_1 Int)) (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) .cse2 1) .cse23)))) (and .cse21 (exists ((v_prenex_3 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_3) .cse2 1))) (and (= (select .cse24 .cse23) 0) (= (select .cse24 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_3)))) .cse19))) .cse27)))))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (or .cse10 .cse36) (let ((.cse39 (store .cse18 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1)) (.cse40 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (or (and (let ((.cse37 (= |c_#valid| (store .cse40 .cse23 .cse26)))) (or (and .cse37 .cse31 (exists ((v_prenex_3 Int)) (let ((.cse38 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_3) |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse38 .cse23) 0) (= (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_3))))) (and (= (select .cse39 .cse23) 0) (= |c_#valid| (store .cse39 .cse23 .cse26)) .cse16 (not .cse22)) (and .cse22 (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) .cse23) 0)) .cse37))) .cse20 .cse27) (and .cse9 (let ((.cse41 (= |c_#valid| (store .cse40 .cse12 .cse14)))) (or (and .cse13 (= |c_#valid| (store .cse39 .cse12 .cse14)) .cse16 (= (select .cse39 .cse12) 0)) (and .cse41 .cse31 (exists ((v_prenex_3 Int)) (let ((.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_3) |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse42 .cse12) 0) (= (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_3))))) (and .cse33 .cse41 (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) .cse12) 0))))) .cse3)))))))))))) is different from true