./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/tree_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:43:13,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:43:13,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:43:13,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:43:13,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:43:13,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:43:13,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:43:13,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:43:13,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:43:13,683 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:43:13,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:43:13,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:43:13,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:43:13,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:43:13,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:43:13,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:43:13,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:43:13,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:43:13,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:43:13,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:43:13,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:43:13,688 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:43:13,688 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:43:13,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:43:13,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:43:13,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:43:13,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:43:13,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:43:13,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:43:13,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:43:13,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:43:13,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:43:13,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:43:13,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:43:13,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:43:13,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:43:13,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:43:13,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:43:13,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:43:13,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:43:13,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:43:13,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:43:13,695 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-11-22 18:43:13,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:43:13,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:43:13,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:43:13,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:43:13,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:43:13,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-22 18:43:15,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:43:15,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:43:15,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-22 18:43:15,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd279e5c/5128b40fd0e74f7ba107b0d34b0d6251/FLAGfca1cc07a [2024-11-22 18:43:15,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd279e5c/5128b40fd0e74f7ba107b0d34b0d6251 [2024-11-22 18:43:15,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:43:15,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:43:15,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:43:15,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:43:15,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:43:15,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:43:15" (1/1) ... [2024-11-22 18:43:15,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5353d0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:15, skipping insertion in model container [2024-11-22 18:43:15,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:43:15" (1/1) ... [2024-11-22 18:43:15,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:43:16,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:43:16,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:43:16,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:43:16,197 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:43:16,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16 WrapperNode [2024-11-22 18:43:16,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:43:16,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:43:16,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:43:16,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:43:16,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,265 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-22 18:43:16,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:43:16,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:43:16,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:43:16,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:43:16,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,303 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-22 18:43:16,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:43:16,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:43:16,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:43:16,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:43:16,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (1/1) ... [2024-11-22 18:43:16,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:43:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:16,367 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-22 18:43:16,370 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-22 18:43:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:43:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:43:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:43:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:43:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:43:16,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:43:16,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:43:16,999 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2024-11-22 18:43:16,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:43:17,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:43:17,023 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 18:43:17,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:43:17 BoogieIcfgContainer [2024-11-22 18:43:17,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:43:17,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:43:17,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:43:17,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:43:17,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:43:15" (1/3) ... [2024-11-22 18:43:17,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff0b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:43:17, skipping insertion in model container [2024-11-22 18:43:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:16" (2/3) ... [2024-11-22 18:43:17,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff0b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:43:17, skipping insertion in model container [2024-11-22 18:43:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:43:17" (3/3) ... [2024-11-22 18:43:17,035 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2024-11-22 18:43:17,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:43:17,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-22 18:43:17,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:43:17,125 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;@297603de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:43:17,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-22 18:43:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:43:17,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:17,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:43:17,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-22 18:43:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411389759] [2024-11-22 18:43:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:17,393 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-22 18:43:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411389759] [2024-11-22 18:43:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411389759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650661363] [2024-11-22 18:43:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:17,439 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 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-22 18:43:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:17,639 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2024-11-22 18:43:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:17,641 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-22 18:43:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:17,650 INFO L225 Difference]: With dead ends: 152 [2024-11-22 18:43:17,651 INFO L226 Difference]: Without dead ends: 150 [2024-11-22 18:43:17,653 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-22 18:43:17,657 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-22 18:43:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-22 18:43:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2024-11-22 18:43:17,697 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 3 [2024-11-22 18:43:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:17,697 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2024-11-22 18:43:17,697 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-22 18:43:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2024-11-22 18:43:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:43:17,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:17,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:43:17,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:43:17,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-22 18:43:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894699279] [2024-11-22 18:43:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:17,801 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-22 18:43:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894699279] [2024-11-22 18:43:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894699279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693778339] [2024-11-22 18:43:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:17,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:17,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:17,805 INFO L87 Difference]: Start difference. First operand 150 states and 160 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-22 18:43:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:17,922 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-22 18:43:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:17,923 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-22 18:43:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:17,926 INFO L225 Difference]: With dead ends: 147 [2024-11-22 18:43:17,926 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 18:43:17,928 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-22 18:43:17,929 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:17,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 18:43:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-22 18:43:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 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-22 18:43:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2024-11-22 18:43:17,942 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 3 [2024-11-22 18:43:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:17,942 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2024-11-22 18:43:17,943 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-22 18:43:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2024-11-22 18:43:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:43:17,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:17,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:17,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:43:17,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:17,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash 59265651, now seen corresponding path program 1 times [2024-11-22 18:43:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:17,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867726354] [2024-11-22 18:43:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867726354] [2024-11-22 18:43:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867726354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:18,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:18,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:18,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382005187] [2024-11-22 18:43:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:18,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:43:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:43:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:18,077 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:18,301 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2024-11-22 18:43:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:43:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:18,304 INFO L225 Difference]: With dead ends: 152 [2024-11-22 18:43:18,304 INFO L226 Difference]: Without dead ends: 152 [2024-11-22 18:43:18,329 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-22 18:43:18,330 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 175 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:18,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 124 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-22 18:43:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2024-11-22 18:43:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2024-11-22 18:43:18,346 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 8 [2024-11-22 18:43:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2024-11-22 18:43:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2024-11-22 18:43:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:43:18,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:18,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:18,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:43:18,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 59265652, now seen corresponding path program 1 times [2024-11-22 18:43:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784218198] [2024-11-22 18:43:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:18,590 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-22 18:43:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784218198] [2024-11-22 18:43:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784218198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650294923] [2024-11-22 18:43:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:43:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:43:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:18,593 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:18,804 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2024-11-22 18:43:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:43:18,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:43:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:18,807 INFO L225 Difference]: With dead ends: 183 [2024-11-22 18:43:18,807 INFO L226 Difference]: Without dead ends: 183 [2024-11-22 18:43:18,807 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-22 18:43:18,808 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 184 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:18,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 180 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-22 18:43:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2024-11-22 18:43:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-22 18:43:18,826 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 8 [2024-11-22 18:43:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-22 18:43:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-22 18:43:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:43:18,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:18,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:18,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:43:18,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237128, now seen corresponding path program 1 times [2024-11-22 18:43:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729293794] [2024-11-22 18:43:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:18,897 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-22 18:43:18,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729293794] [2024-11-22 18:43:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729293794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:18,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024677079] [2024-11-22 18:43:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:18,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:18,899 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:18,989 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2024-11-22 18:43:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-22 18:43:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:18,992 INFO L225 Difference]: With dead ends: 167 [2024-11-22 18:43:18,992 INFO L226 Difference]: Without dead ends: 167 [2024-11-22 18:43:18,993 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-22 18:43:18,994 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:18,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 200 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-22 18:43:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-22 18:43:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2024-11-22 18:43:19,005 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 9 [2024-11-22 18:43:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:19,005 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2024-11-22 18:43:19,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2024-11-22 18:43:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:43:19,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:19,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:19,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:43:19,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:19,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237129, now seen corresponding path program 1 times [2024-11-22 18:43:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493168075] [2024-11-22 18:43:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:19,109 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-22 18:43:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493168075] [2024-11-22 18:43:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493168075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029814331] [2024-11-22 18:43:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:19,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:19,111 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:19,219 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2024-11-22 18:43:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:19,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-22 18:43:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:19,221 INFO L225 Difference]: With dead ends: 165 [2024-11-22 18:43:19,222 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 18:43:19,222 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-22 18:43:19,223 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:19,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 18:43:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-22 18:43:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 193 transitions. [2024-11-22 18:43:19,236 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 193 transitions. Word has length 9 [2024-11-22 18:43:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 193 transitions. [2024-11-22 18:43:19,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2024-11-22 18:43:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:43:19,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:19,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:19,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:43:19,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:19,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 243138738, now seen corresponding path program 1 times [2024-11-22 18:43:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:19,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195776711] [2024-11-22 18:43:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195776711] [2024-11-22 18:43:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195776711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165733045] [2024-11-22 18:43:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:19,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:19,289 INFO L87 Difference]: Start difference. First operand 165 states and 193 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:19,307 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2024-11-22 18:43:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 18:43:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:19,309 INFO L225 Difference]: With dead ends: 165 [2024-11-22 18:43:19,309 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 18:43:19,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:19,310 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:19,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 254 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 18:43:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-22 18:43:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2024-11-22 18:43:19,320 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 13 [2024-11-22 18:43:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:19,321 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2024-11-22 18:43:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2024-11-22 18:43:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:43:19,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:19,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:43:19,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634445, now seen corresponding path program 1 times [2024-11-22 18:43:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407652583] [2024-11-22 18:43:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407652583] [2024-11-22 18:43:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407652583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:19,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576260272] [2024-11-22 18:43:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:19,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:19,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:19,431 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:19,601 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2024-11-22 18:43:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:43:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:19,602 INFO L225 Difference]: With dead ends: 172 [2024-11-22 18:43:19,602 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 18:43:19,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:19,603 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:19,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 315 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 18:43:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-11-22 18:43:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2024-11-22 18:43:19,608 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 14 [2024-11-22 18:43:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:19,608 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2024-11-22 18:43:19,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2024-11-22 18:43:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:43:19,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:19,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:43:19,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634444, now seen corresponding path program 1 times [2024-11-22 18:43:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517290263] [2024-11-22 18:43:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:19,763 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-22 18:43:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:19,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517290263] [2024-11-22 18:43:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517290263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:19,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:43:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817809869] [2024-11-22 18:43:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:19,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:43:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:43:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:43:19,769 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:19,956 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2024-11-22 18:43:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:43:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:43:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:19,958 INFO L225 Difference]: With dead ends: 174 [2024-11-22 18:43:19,958 INFO L226 Difference]: Without dead ends: 174 [2024-11-22 18:43:19,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:43:19,959 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:19,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 331 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-22 18:43:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2024-11-22 18:43:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2024-11-22 18:43:19,963 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 14 [2024-11-22 18:43:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2024-11-22 18:43:19,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2024-11-22 18:43:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:43:19,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:19,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:19,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:43:19,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:19,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 395262676, now seen corresponding path program 1 times [2024-11-22 18:43:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878039394] [2024-11-22 18:43:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878039394] [2024-11-22 18:43:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878039394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272853262] [2024-11-22 18:43:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:19,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:19,993 INFO L87 Difference]: Start difference. First operand 169 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:20,003 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2024-11-22 18:43:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 18:43:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:20,005 INFO L225 Difference]: With dead ends: 171 [2024-11-22 18:43:20,005 INFO L226 Difference]: Without dead ends: 171 [2024-11-22 18:43:20,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:20,006 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:20,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-22 18:43:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-22 18:43:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2024-11-22 18:43:20,010 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 15 [2024-11-22 18:43:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:20,010 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2024-11-22 18:43:20,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2024-11-22 18:43:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:43:20,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:20,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:43:20,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1476383815, now seen corresponding path program 1 times [2024-11-22 18:43:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230574009] [2024-11-22 18:43:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:20,074 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-22 18:43:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230574009] [2024-11-22 18:43:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230574009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013818042] [2024-11-22 18:43:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:20,076 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:20,151 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2024-11-22 18:43:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:43:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-22 18:43:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:20,152 INFO L225 Difference]: With dead ends: 177 [2024-11-22 18:43:20,152 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 18:43:20,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:43:20,153 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 19 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:20,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 331 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 18:43:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2024-11-22 18:43:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2024-11-22 18:43:20,157 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 17 [2024-11-22 18:43:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2024-11-22 18:43:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2024-11-22 18:43:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:43:20,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:20,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:43:20,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1645245929, now seen corresponding path program 1 times [2024-11-22 18:43:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808948325] [2024-11-22 18:43:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808948325] [2024-11-22 18:43:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808948325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:43:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036239697] [2024-11-22 18:43:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:43:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:43:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:43:20,400 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:20,617 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2024-11-22 18:43:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:43:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-22 18:43:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:20,618 INFO L225 Difference]: With dead ends: 211 [2024-11-22 18:43:20,619 INFO L226 Difference]: Without dead ends: 211 [2024-11-22 18:43:20,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:20,619 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:20,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 477 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-22 18:43:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2024-11-22 18:43:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-22 18:43:20,624 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 17 [2024-11-22 18:43:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:20,624 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-22 18:43:20,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-22 18:43:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:43:20,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:20,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:20,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:43:20,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631940, now seen corresponding path program 1 times [2024-11-22 18:43:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218513574] [2024-11-22 18:43:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:21,090 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-22 18:43:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218513574] [2024-11-22 18:43:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218513574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:43:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053193867] [2024-11-22 18:43:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:21,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:43:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:43:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:43:21,091 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:21,621 INFO L93 Difference]: Finished difference Result 203 states and 245 transitions. [2024-11-22 18:43:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 18:43:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:43:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:21,623 INFO L225 Difference]: With dead ends: 203 [2024-11-22 18:43:21,623 INFO L226 Difference]: Without dead ends: 203 [2024-11-22 18:43:21,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:43:21,624 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:21,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 315 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:43:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-22 18:43:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2024-11-22 18:43:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2024-11-22 18:43:21,628 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 19 [2024-11-22 18:43:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2024-11-22 18:43:21,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2024-11-22 18:43:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:43:21,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:21,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:43:21,630 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:21,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631939, now seen corresponding path program 1 times [2024-11-22 18:43:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:21,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224806591] [2024-11-22 18:43:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:22,079 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-22 18:43:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224806591] [2024-11-22 18:43:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224806591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:43:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917091017] [2024-11-22 18:43:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:43:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:43:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:43:22,081 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:22,586 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2024-11-22 18:43:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:43:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:43:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:22,588 INFO L225 Difference]: With dead ends: 213 [2024-11-22 18:43:22,588 INFO L226 Difference]: Without dead ends: 213 [2024-11-22 18:43:22,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:43:22,588 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 320 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:22,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 355 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:43:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-22 18:43:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2024-11-22 18:43:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2024-11-22 18:43:22,593 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 19 [2024-11-22 18:43:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:22,593 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2024-11-22 18:43:22,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2024-11-22 18:43:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:43:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:22,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:43:22,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -825042817, now seen corresponding path program 1 times [2024-11-22 18:43:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003617135] [2024-11-22 18:43:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:22,684 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-22 18:43:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:22,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003617135] [2024-11-22 18:43:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003617135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225158173] [2024-11-22 18:43:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:22,686 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:22,842 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-11-22 18:43:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:43:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:22,843 INFO L225 Difference]: With dead ends: 194 [2024-11-22 18:43:22,843 INFO L226 Difference]: Without dead ends: 194 [2024-11-22 18:43:22,844 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-22 18:43:22,844 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:22,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 302 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-22 18:43:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-22 18:43:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2024-11-22 18:43:22,848 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 19 [2024-11-22 18:43:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:22,848 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2024-11-22 18:43:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2024-11-22 18:43:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:43:22,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:22,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:22,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:43:22,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:22,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash -825042816, now seen corresponding path program 1 times [2024-11-22 18:43:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87157326] [2024-11-22 18:43:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:22,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:22,981 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-22 18:43:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87157326] [2024-11-22 18:43:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87157326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334687697] [2024-11-22 18:43:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:22,983 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:23,154 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2024-11-22 18:43:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:43:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:23,155 INFO L225 Difference]: With dead ends: 193 [2024-11-22 18:43:23,155 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 18:43:23,156 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-22 18:43:23,156 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:23,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 280 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 18:43:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-22 18:43:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2024-11-22 18:43:23,160 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 19 [2024-11-22 18:43:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2024-11-22 18:43:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2024-11-22 18:43:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:43:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:23,161 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] [2024-11-22 18:43:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:43:23,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash -3442432, now seen corresponding path program 1 times [2024-11-22 18:43:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944219573] [2024-11-22 18:43:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:23,252 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-22 18:43:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944219573] [2024-11-22 18:43:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944219573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603653016] [2024-11-22 18:43:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:43:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:43:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:23,254 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:23,398 INFO L93 Difference]: Finished difference Result 198 states and 239 transitions. [2024-11-22 18:43:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 18:43:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:23,399 INFO L225 Difference]: With dead ends: 198 [2024-11-22 18:43:23,399 INFO L226 Difference]: Without dead ends: 198 [2024-11-22 18:43:23,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:23,400 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:23,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 99 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-22 18:43:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2024-11-22 18:43:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2024-11-22 18:43:23,403 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 22 [2024-11-22 18:43:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:23,404 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2024-11-22 18:43:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2024-11-22 18:43:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:43:23,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:23,405 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] [2024-11-22 18:43:23,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:43:23,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:23,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328411, now seen corresponding path program 1 times [2024-11-22 18:43:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427095056] [2024-11-22 18:43:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427095056] [2024-11-22 18:43:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427095056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:43:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375351575] [2024-11-22 18:43:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:43:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:43:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:23,562 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:23,837 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2024-11-22 18:43:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:43:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 18:43:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:23,839 INFO L225 Difference]: With dead ends: 196 [2024-11-22 18:43:23,839 INFO L226 Difference]: Without dead ends: 196 [2024-11-22 18:43:23,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:43:23,839 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 138 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:23,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 251 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-22 18:43:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2024-11-22 18:43:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 222 transitions. [2024-11-22 18:43:23,843 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 222 transitions. Word has length 22 [2024-11-22 18:43:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:23,843 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 222 transitions. [2024-11-22 18:43:23,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 222 transitions. [2024-11-22 18:43:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:43:23,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:23,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:23,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:43:23,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328412, now seen corresponding path program 1 times [2024-11-22 18:43:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543746713] [2024-11-22 18:43:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:24,167 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-22 18:43:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543746713] [2024-11-22 18:43:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543746713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:43:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419881570] [2024-11-22 18:43:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:43:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:43:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:24,170 INFO L87 Difference]: Start difference. First operand 184 states and 222 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:24,508 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2024-11-22 18:43:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:43:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 18:43:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:24,509 INFO L225 Difference]: With dead ends: 195 [2024-11-22 18:43:24,509 INFO L226 Difference]: Without dead ends: 195 [2024-11-22 18:43:24,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:43:24,510 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:24,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 288 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-22 18:43:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2024-11-22 18:43:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2024-11-22 18:43:24,514 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 22 [2024-11-22 18:43:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:24,514 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2024-11-22 18:43:24,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2024-11-22 18:43:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:43:24,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:24,515 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-22 18:43:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:43:24,516 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:24,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash -19499741, now seen corresponding path program 1 times [2024-11-22 18:43:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373201009] [2024-11-22 18:43:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:24,597 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-22 18:43:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373201009] [2024-11-22 18:43:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373201009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:24,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20705116] [2024-11-22 18:43:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:24,600 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:24,749 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2024-11-22 18:43:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:24,750 INFO L225 Difference]: With dead ends: 182 [2024-11-22 18:43:24,750 INFO L226 Difference]: Without dead ends: 182 [2024-11-22 18:43:24,751 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-22 18:43:24,751 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 3 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:24,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 271 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-22 18:43:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-22 18:43:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2024-11-22 18:43:24,755 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 23 [2024-11-22 18:43:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:24,756 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2024-11-22 18:43:24,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2024-11-22 18:43:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:43:24,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:24,756 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-22 18:43:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 18:43:24,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -19499740, now seen corresponding path program 1 times [2024-11-22 18:43:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047653220] [2024-11-22 18:43:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:24,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047653220] [2024-11-22 18:43:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047653220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:24,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:24,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23450660] [2024-11-22 18:43:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:24,902 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:25,068 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2024-11-22 18:43:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:25,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:25,070 INFO L225 Difference]: With dead ends: 181 [2024-11-22 18:43:25,070 INFO L226 Difference]: Without dead ends: 181 [2024-11-22 18:43:25,070 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-22 18:43:25,071 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:25,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-22 18:43:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-22 18:43:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 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-22 18:43:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2024-11-22 18:43:25,075 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2024-11-22 18:43:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2024-11-22 18:43:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-22 18:43:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2024-11-22 18:43:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:43:25,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:25,076 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-22 18:43:25,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 18:43:25,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash 998290617, now seen corresponding path program 1 times [2024-11-22 18:43:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021734944] [2024-11-22 18:43:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:25,293 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-22 18:43:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021734944] [2024-11-22 18:43:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021734944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:43:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574746071] [2024-11-22 18:43:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:43:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:25,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:43:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:43:25,296 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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-22 18:43:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:25,718 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2024-11-22 18:43:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:43:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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-22 18:43:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:25,719 INFO L225 Difference]: With dead ends: 215 [2024-11-22 18:43:25,719 INFO L226 Difference]: Without dead ends: 215 [2024-11-22 18:43:25,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:43:25,720 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 184 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:25,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 435 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-22 18:43:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2024-11-22 18:43:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2024-11-22 18:43:25,725 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 24 [2024-11-22 18:43:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:25,725 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2024-11-22 18:43:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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-22 18:43:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2024-11-22 18:43:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:43:25,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:25,726 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-22 18:43:25,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 18:43:25,726 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 998278641, now seen corresponding path program 1 times [2024-11-22 18:43:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799991804] [2024-11-22 18:43:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:25,831 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-22 18:43:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799991804] [2024-11-22 18:43:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799991804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748196742] [2024-11-22 18:43:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:25,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:25,833 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-22 18:43:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:26,003 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2024-11-22 18:43:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:43:26,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-22 18:43:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:26,004 INFO L225 Difference]: With dead ends: 234 [2024-11-22 18:43:26,004 INFO L226 Difference]: Without dead ends: 234 [2024-11-22 18:43:26,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:26,005 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 79 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:26,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 150 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-22 18:43:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 172. [2024-11-22 18:43:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2024-11-22 18:43:26,008 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 24 [2024-11-22 18:43:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2024-11-22 18:43:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-22 18:43:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2024-11-22 18:43:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:43:26,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:26,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:26,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 18:43:26,010 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 525851589, now seen corresponding path program 1 times [2024-11-22 18:43:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032070673] [2024-11-22 18:43:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:26,617 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-22 18:43:26,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032070673] [2024-11-22 18:43:26,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032070673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:26,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:26,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:43:26,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534449680] [2024-11-22 18:43:26,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:26,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:43:26,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:43:26,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:43:26,619 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:27,291 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2024-11-22 18:43:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:43:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 18:43:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:27,292 INFO L225 Difference]: With dead ends: 224 [2024-11-22 18:43:27,292 INFO L226 Difference]: Without dead ends: 224 [2024-11-22 18:43:27,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:43:27,293 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 243 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:27,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 329 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:43:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-22 18:43:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2024-11-22 18:43:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2024-11-22 18:43:27,298 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 25 [2024-11-22 18:43:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:27,298 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2024-11-22 18:43:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2024-11-22 18:43:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:43:27,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:27,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:27,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 18:43:27,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:27,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -896291290, now seen corresponding path program 1 times [2024-11-22 18:43:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459900749] [2024-11-22 18:43:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:27,518 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-22 18:43:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459900749] [2024-11-22 18:43:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459900749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:27,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:27,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:43:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362715677] [2024-11-22 18:43:27,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:27,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:43:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:43:27,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:43:27,520 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:27,899 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-22 18:43:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:43:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 18:43:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:27,902 INFO L225 Difference]: With dead ends: 196 [2024-11-22 18:43:27,902 INFO L226 Difference]: Without dead ends: 196 [2024-11-22 18:43:27,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:43:27,903 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 133 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:27,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 365 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-22 18:43:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2024-11-22 18:43:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 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-22 18:43:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2024-11-22 18:43:27,907 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 25 [2024-11-22 18:43:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:27,907 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2024-11-22 18:43:27,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2024-11-22 18:43:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:43:27,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:27,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:27,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 18:43:27,908 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:27,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash -896291289, now seen corresponding path program 1 times [2024-11-22 18:43:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:27,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246753125] [2024-11-22 18:43:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:27,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246753125] [2024-11-22 18:43:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246753125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:43:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576196172] [2024-11-22 18:43:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:28,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:43:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:28,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:43:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:43:28,215 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:28,538 INFO L93 Difference]: Finished difference Result 182 states and 212 transitions. [2024-11-22 18:43:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:43:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 18:43:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:28,539 INFO L225 Difference]: With dead ends: 182 [2024-11-22 18:43:28,539 INFO L226 Difference]: Without dead ends: 182 [2024-11-22 18:43:28,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:43:28,539 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 121 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:28,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 287 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-22 18:43:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2024-11-22 18:43:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-22 18:43:28,543 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 25 [2024-11-22 18:43:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:28,543 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-22 18:43:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-22 18:43:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:43:28,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:28,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 18:43:28,544 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:28,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103808, now seen corresponding path program 1 times [2024-11-22 18:43:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148442299] [2024-11-22 18:43:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:28,706 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-22 18:43:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148442299] [2024-11-22 18:43:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148442299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:43:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285577259] [2024-11-22 18:43:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:43:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:28,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:43:28,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:28,708 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:28,981 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2024-11-22 18:43:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:43:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:28,983 INFO L225 Difference]: With dead ends: 181 [2024-11-22 18:43:28,983 INFO L226 Difference]: Without dead ends: 181 [2024-11-22 18:43:28,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:43:28,984 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:28,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 239 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-22 18:43:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2024-11-22 18:43:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-11-22 18:43:28,987 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 26 [2024-11-22 18:43:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-11-22 18:43:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-11-22 18:43:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:43:28,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:28,988 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-22 18:43:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 18:43:28,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103807, now seen corresponding path program 1 times [2024-11-22 18:43:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768059947] [2024-11-22 18:43:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:29,219 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-22 18:43:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768059947] [2024-11-22 18:43:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768059947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:29,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:43:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621516890] [2024-11-22 18:43:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:43:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:29,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:43:29,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:29,222 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:29,503 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2024-11-22 18:43:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:43:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:29,504 INFO L225 Difference]: With dead ends: 180 [2024-11-22 18:43:29,505 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 18:43:29,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:43:29,505 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:29,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 241 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 18:43:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2024-11-22 18:43:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2024-11-22 18:43:29,509 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 26 [2024-11-22 18:43:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:29,509 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2024-11-22 18:43:29,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-22 18:43:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2024-11-22 18:43:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:43:29,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:29,510 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] [2024-11-22 18:43:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 18:43:29,510 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1722459940, now seen corresponding path program 1 times [2024-11-22 18:43:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449283401] [2024-11-22 18:43:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449283401] [2024-11-22 18:43:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449283401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746641366] [2024-11-22 18:43:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:29,665 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-22 18:43:29,667 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-22 18:43:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:29,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 18:43:29,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:29,842 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-22 18:43:29,849 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-22 18:43:29,873 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-22 18:43:29,888 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-22 18:43:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:29,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:30,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746641366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:30,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:30,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-22 18:43:30,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077883007] [2024-11-22 18:43:30,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:30,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:43:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:43:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:30,003 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:30,077 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2024-11-22 18:43:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-22 18:43:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:30,079 INFO L225 Difference]: With dead ends: 171 [2024-11-22 18:43:30,079 INFO L226 Difference]: Without dead ends: 171 [2024-11-22 18:43:30,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:30,080 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:30,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 343 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-22 18:43:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-11-22 18:43:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-22 18:43:30,083 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2024-11-22 18:43:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:30,083 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-22 18:43:30,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-22 18:43:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:43:30,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:30,084 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-22 18:43:30,094 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-22 18:43:30,285 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,SelfDestructingSolverStorable28 [2024-11-22 18:43:30,285 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1856650752, now seen corresponding path program 1 times [2024-11-22 18:43:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120831478] [2024-11-22 18:43:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120831478] [2024-11-22 18:43:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120831478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498194349] [2024-11-22 18:43:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:30,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:30,650 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-22 18:43:30,652 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-22 18:43:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:30,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 18:43:30,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:30,909 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-22 18:43:31,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:31,006 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 46 treesize of output 36 [2024-11-22 18:43:31,391 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1.base_87| Int) (|v_ULTIMATE.start_main_~st~0#1.base_30| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_87|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_87| 1) |v_ULTIMATE.start_main_~st~0#1.base_30|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~st~0#1.base_30| 0) |v_ULTIMATE.start_main_~n~0#1.base_87| 0)))) is different from true [2024-11-22 18:43:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-22 18:43:31,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:31,585 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 22 treesize of output 20 [2024-11-22 18:43:31,588 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 38 treesize of output 36 [2024-11-22 18:43:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498194349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:36,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:36,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-11-22 18:43:36,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935412142] [2024-11-22 18:43:36,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:36,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 18:43:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:36,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 18:43:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=582, Unknown=1, NotChecked=48, Total=702 [2024-11-22 18:43:36,017 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:37,294 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2024-11-22 18:43:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:43:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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-22 18:43:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:37,295 INFO L225 Difference]: With dead ends: 202 [2024-11-22 18:43:37,295 INFO L226 Difference]: Without dead ends: 196 [2024-11-22 18:43:37,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=149, Invalid=1186, Unknown=1, NotChecked=70, Total=1406 [2024-11-22 18:43:37,296 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:37,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 719 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1006 Invalid, 0 Unknown, 154 Unchecked, 0.9s Time] [2024-11-22 18:43:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-22 18:43:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2024-11-22 18:43:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 167 states have (on average 1.281437125748503) internal successors, (214), 184 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2024-11-22 18:43:37,300 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 28 [2024-11-22 18:43:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:37,300 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2024-11-22 18:43:37,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2024-11-22 18:43:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:43:37,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:37,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:37,310 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-22 18:43:37,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:37,502 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:37,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 607909674, now seen corresponding path program 1 times [2024-11-22 18:43:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:37,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826864902] [2024-11-22 18:43:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:37,756 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-22 18:43:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826864902] [2024-11-22 18:43:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826864902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:43:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640337789] [2024-11-22 18:43:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:43:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:43:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:43:37,760 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:38,079 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2024-11-22 18:43:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:43:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 18:43:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:38,080 INFO L225 Difference]: With dead ends: 204 [2024-11-22 18:43:38,080 INFO L226 Difference]: Without dead ends: 204 [2024-11-22 18:43:38,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:43:38,081 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 111 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:38,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 278 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-22 18:43:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2024-11-22 18:43:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 183 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2024-11-22 18:43:38,085 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 29 [2024-11-22 18:43:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:38,085 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2024-11-22 18:43:38,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2024-11-22 18:43:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:43:38,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:38,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:38,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 18:43:38,087 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:38,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:38,087 INFO L85 PathProgramCache]: Analyzing trace with hash 607909675, now seen corresponding path program 1 times [2024-11-22 18:43:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832733767] [2024-11-22 18:43:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:38,537 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-22 18:43:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832733767] [2024-11-22 18:43:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832733767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:38,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:43:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805453370] [2024-11-22 18:43:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:43:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:43:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:43:38,539 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:39,014 INFO L93 Difference]: Finished difference Result 238 states and 275 transitions. [2024-11-22 18:43:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:43:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 18:43:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:39,016 INFO L225 Difference]: With dead ends: 238 [2024-11-22 18:43:39,016 INFO L226 Difference]: Without dead ends: 238 [2024-11-22 18:43:39,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:43:39,018 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 137 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:39,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 401 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:43:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-22 18:43:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 215. [2024-11-22 18:43:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2575757575757576) internal successors, (249), 214 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2024-11-22 18:43:39,022 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 29 [2024-11-22 18:43:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:39,023 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2024-11-22 18:43:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2024-11-22 18:43:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 18:43:39,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:39,023 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] [2024-11-22 18:43:39,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 18:43:39,023 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 997305066, now seen corresponding path program 1 times [2024-11-22 18:43:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517184942] [2024-11-22 18:43:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:39,134 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-22 18:43:39,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517184942] [2024-11-22 18:43:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517184942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:39,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:43:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325913222] [2024-11-22 18:43:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:39,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:43:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:43:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:43:39,136 INFO L87 Difference]: Start difference. First operand 215 states and 249 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-22 18:43:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:39,322 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2024-11-22 18:43:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:43:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-22 18:43:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:39,324 INFO L225 Difference]: With dead ends: 240 [2024-11-22 18:43:39,324 INFO L226 Difference]: Without dead ends: 240 [2024-11-22 18:43:39,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:43:39,324 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:39,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 169 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-22 18:43:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2024-11-22 18:43:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2525252525252526) internal successors, (248), 214 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2024-11-22 18:43:39,328 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 31 [2024-11-22 18:43:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:39,329 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2024-11-22 18:43:39,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-22 18:43:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2024-11-22 18:43:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:43:39,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:39,329 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-22 18:43:39,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 18:43:39,330 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:39,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 851686138, now seen corresponding path program 1 times [2024-11-22 18:43:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365373869] [2024-11-22 18:43:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365373869] [2024-11-22 18:43:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365373869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:43:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243987198] [2024-11-22 18:43:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:43:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:43:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:39,374 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-22 18:43:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:39,420 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2024-11-22 18:43:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:43:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-22 18:43:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:39,422 INFO L225 Difference]: With dead ends: 221 [2024-11-22 18:43:39,422 INFO L226 Difference]: Without dead ends: 221 [2024-11-22 18:43:39,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:43:39,425 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:39,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 263 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-22 18:43:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-22 18:43:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2474747474747474) internal successors, (247), 214 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 247 transitions. [2024-11-22 18:43:39,430 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 247 transitions. Word has length 32 [2024-11-22 18:43:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:39,430 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 247 transitions. [2024-11-22 18:43:39,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-22 18:43:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 247 transitions. [2024-11-22 18:43:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:43:39,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:39,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:39,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-22 18:43:39,431 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 632465771, now seen corresponding path program 1 times [2024-11-22 18:43:39,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290660972] [2024-11-22 18:43:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:43:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290660972] [2024-11-22 18:43:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290660972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:39,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120472462] [2024-11-22 18:43:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:43:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:43:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:39,498 INFO L87 Difference]: Start difference. First operand 215 states and 247 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-22 18:43:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:39,599 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2024-11-22 18:43:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:43:39,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-22 18:43:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:39,600 INFO L225 Difference]: With dead ends: 214 [2024-11-22 18:43:39,600 INFO L226 Difference]: Without dead ends: 214 [2024-11-22 18:43:39,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:43:39,601 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:39,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-22 18:43:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-22 18:43:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 198 states have (on average 1.2373737373737375) internal successors, (245), 213 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2024-11-22 18:43:39,605 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 33 [2024-11-22 18:43:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:39,605 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2024-11-22 18:43:39,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-22 18:43:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2024-11-22 18:43:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 18:43:39,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:39,606 INFO L215 NwaCegarLoop]: trace histogram [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-22 18:43:39,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-22 18:43:39,607 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1155721340, now seen corresponding path program 1 times [2024-11-22 18:43:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100863415] [2024-11-22 18:43:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100863415] [2024-11-22 18:43:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100863415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 18:43:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175634077] [2024-11-22 18:43:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 18:43:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 18:43:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-22 18:43:40,297 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-22 18:43:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:40,951 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2024-11-22 18:43:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:43:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-22 18:43:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:40,953 INFO L225 Difference]: With dead ends: 239 [2024-11-22 18:43:40,953 INFO L226 Difference]: Without dead ends: 232 [2024-11-22 18:43:40,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:43:40,953 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 166 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:40,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:43:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-22 18:43:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 212. [2024-11-22 18:43:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 196 states have (on average 1.2346938775510203) internal successors, (242), 211 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2024-11-22 18:43:40,959 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 38 [2024-11-22 18:43:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:40,959 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2024-11-22 18:43:40,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-22 18:43:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2024-11-22 18:43:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 18:43:40,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:40,960 INFO L215 NwaCegarLoop]: trace histogram [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-22 18:43:40,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-22 18:43:40,960 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:40,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1546128188, now seen corresponding path program 1 times [2024-11-22 18:43:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285506569] [2024-11-22 18:43:40,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285506569] [2024-11-22 18:43:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285506569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:41,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 18:43:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268301571] [2024-11-22 18:43:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:43:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:41,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:43:41,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:43:41,710 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-22 18:43:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:42,150 INFO L93 Difference]: Finished difference Result 228 states and 259 transitions. [2024-11-22 18:43:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:43:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-22 18:43:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:42,151 INFO L225 Difference]: With dead ends: 228 [2024-11-22 18:43:42,151 INFO L226 Difference]: Without dead ends: 203 [2024-11-22 18:43:42,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:43:42,151 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 137 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:42,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 516 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-22 18:43:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-11-22 18:43:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 198 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2024-11-22 18:43:42,155 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 38 [2024-11-22 18:43:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:42,155 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2024-11-22 18:43:42,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-22 18:43:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2024-11-22 18:43:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:43:42,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:42,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:42,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-22 18:43:42,157 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -936117449, now seen corresponding path program 1 times [2024-11-22 18:43:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675743179] [2024-11-22 18:43:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675743179] [2024-11-22 18:43:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675743179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590254495] [2024-11-22 18:43:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:42,720 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-22 18:43:42,721 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-22 18:43:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:42,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-22 18:43:42,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:42,858 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-22 18:43:42,862 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-22 18:43:42,877 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 21 treesize of output 20 [2024-11-22 18:43:42,886 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-22 18:43:42,915 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 21 treesize of output 20 [2024-11-22 18:43:42,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-22 18:43:43,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:43,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:43,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:43,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-22 18:43:43,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:43,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:43,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:43:43,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2024-11-22 18:43:43,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:43,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-11-22 18:43:43,489 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 37 treesize of output 18 [2024-11-22 18:43:43,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:43,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-11-22 18:43:43,612 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 37 treesize of output 18 [2024-11-22 18:43:43,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:43,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2024-11-22 18:43:43,715 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 37 treesize of output 18 [2024-11-22 18:43:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:43,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:43,827 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1429 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1428) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2024-11-22 18:43:43,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_1429 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1428) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-22 18:43:43,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1426))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-22 18:43:43,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1426))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2024-11-22 18:43:43,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1425))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1424) .cse0 v_ArrVal_1427) (select (select (store .cse1 .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1429))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1425))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1426)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-22 18:43:44,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:44,365 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 194 treesize of output 212 [2024-11-22 18:43:44,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_prenex_3 Int) (v_ArrVal_1422 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 v_prenex_3)) v_prenex_3 v_prenex_2))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_1422)) v_prenex_3 v_ArrVal_1424) .cse1 v_ArrVal_1427) (select (select (store .cse2 .cse1 v_prenex_1) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1429))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= v_prenex_3 |c_ULTIMATE.start_main_~n~0#1.base|))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc21#1.base_9| Int)) (or (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 |v_ULTIMATE.start_main_#t~malloc21#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc21#1.base_9| v_ArrVal_1425))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1426)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= |v_ULTIMATE.start_main_#t~malloc21#1.base_9| |c_ULTIMATE.start_main_~n~0#1.base|))))) is different from false [2024-11-22 18:43:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2024-11-22 18:43:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590254495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:44,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2024-11-22 18:43:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319252675] [2024-11-22 18:43:44,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:44,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-22 18:43:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-22 18:43:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=733, Unknown=17, NotChecked=366, Total=1260 [2024-11-22 18:43:44,508 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:46,203 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2024-11-22 18:43:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-22 18:43:46,203 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 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 42 [2024-11-22 18:43:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:46,204 INFO L225 Difference]: With dead ends: 276 [2024-11-22 18:43:46,204 INFO L226 Difference]: Without dead ends: 276 [2024-11-22 18:43:46,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=491, Invalid=2272, Unknown=17, NotChecked=642, Total=3422 [2024-11-22 18:43:46,206 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 280 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1375 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:46,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1120 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1140 Invalid, 0 Unknown, 1375 Unchecked, 0.9s Time] [2024-11-22 18:43:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-22 18:43:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 223. [2024-11-22 18:43:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 207 states have (on average 1.2415458937198067) internal successors, (257), 222 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 257 transitions. [2024-11-22 18:43:46,210 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 257 transitions. Word has length 42 [2024-11-22 18:43:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 257 transitions. [2024-11-22 18:43:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 257 transitions. [2024-11-22 18:43:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:43:46,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:46,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:46,221 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-22 18:43:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:46,413 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -641397770, now seen corresponding path program 1 times [2024-11-22 18:43:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101406427] [2024-11-22 18:43:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101406427] [2024-11-22 18:43:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101406427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651763200] [2024-11-22 18:43:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:46,739 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-22 18:43:46,740 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-22 18:43:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:46,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 18:43:46,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:47,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:47,199 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-22 18:43:47,199 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 30 treesize of output 25 [2024-11-22 18:43:47,208 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-22 18:43:47,209 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 24 treesize of output 12 [2024-11-22 18:43:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651763200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:47,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-22 18:43:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562879839] [2024-11-22 18:43:47,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:43:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:43:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:43:47,274 INFO L87 Difference]: Start difference. First operand 223 states and 257 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:47,741 INFO L93 Difference]: Finished difference Result 280 states and 326 transitions. [2024-11-22 18:43:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:43:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-22 18:43:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:47,743 INFO L225 Difference]: With dead ends: 280 [2024-11-22 18:43:47,743 INFO L226 Difference]: Without dead ends: 280 [2024-11-22 18:43:47,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2024-11-22 18:43:47,743 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 243 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:47,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 716 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-22 18:43:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-11-22 18:43:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 237 states have (on average 1.2447257383966244) internal successors, (295), 252 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 295 transitions. [2024-11-22 18:43:47,748 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 295 transitions. Word has length 42 [2024-11-22 18:43:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:47,748 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 295 transitions. [2024-11-22 18:43:47,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 295 transitions. [2024-11-22 18:43:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:43:47,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:47,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:47,759 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-22 18:43:47,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-22 18:43:47,954 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:47,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1652515020, now seen corresponding path program 1 times [2024-11-22 18:43:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64592088] [2024-11-22 18:43:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:48,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64592088] [2024-11-22 18:43:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64592088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691661591] [2024-11-22 18:43:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:48,856 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-22 18:43:48,857 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-22 18:43:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:49,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 18:43:49,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:49,015 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-22 18:43:49,019 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-22 18:43:49,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 18:43:49,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 18:43:49,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:49,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-22 18:43:49,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-22 18:43:49,388 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:49,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-22 18:43:49,398 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 20 [2024-11-22 18:43:49,480 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:49,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-22 18:43:49,488 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 20 [2024-11-22 18:43:49,570 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:49,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-22 18:43:49,579 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 20 [2024-11-22 18:43:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:43:49,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:43:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691661591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:43:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 29 [2024-11-22 18:43:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808661417] [2024-11-22 18:43:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:43:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:43:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-11-22 18:43:49,646 INFO L87 Difference]: Start difference. First operand 253 states and 295 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:50,106 INFO L93 Difference]: Finished difference Result 277 states and 321 transitions. [2024-11-22 18:43:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:43:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-22 18:43:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:50,107 INFO L225 Difference]: With dead ends: 277 [2024-11-22 18:43:50,108 INFO L226 Difference]: Without dead ends: 277 [2024-11-22 18:43:50,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2024-11-22 18:43:50,109 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 76 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:50,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 428 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-22 18:43:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 264. [2024-11-22 18:43:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 248 states have (on average 1.2338709677419355) internal successors, (306), 263 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2024-11-22 18:43:50,113 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 42 [2024-11-22 18:43:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:50,113 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2024-11-22 18:43:50,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2024-11-22 18:43:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:43:50,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:50,114 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:50,124 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-22 18:43:50,318 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,SelfDestructingSolverStorable39 [2024-11-22 18:43:50,319 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:50,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1377425632, now seen corresponding path program 1 times [2024-11-22 18:43:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:50,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816192733] [2024-11-22 18:43:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816192733] [2024-11-22 18:43:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816192733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:51,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-22 18:43:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314529426] [2024-11-22 18:43:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:43:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:43:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:43:51,107 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:51,769 INFO L93 Difference]: Finished difference Result 406 states and 484 transitions. [2024-11-22 18:43:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 18:43:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-22 18:43:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:51,771 INFO L225 Difference]: With dead ends: 406 [2024-11-22 18:43:51,771 INFO L226 Difference]: Without dead ends: 405 [2024-11-22 18:43:51,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 18:43:51,772 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 209 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:51,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 842 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:43:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-22 18:43:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 365. [2024-11-22 18:43:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 349 states have (on average 1.2664756446991403) internal successors, (442), 364 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 442 transitions. [2024-11-22 18:43:51,778 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 442 transitions. Word has length 53 [2024-11-22 18:43:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 442 transitions. [2024-11-22 18:43:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 442 transitions. [2024-11-22 18:43:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:43:51,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:51,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-22 18:43:51,780 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1458762868, now seen corresponding path program 1 times [2024-11-22 18:43:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89114722] [2024-11-22 18:43:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89114722] [2024-11-22 18:43:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89114722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215006191] [2024-11-22 18:43:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:52,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:52,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:52,279 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-22 18:43:52,280 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-22 18:43:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:52,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 18:43:52,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:52,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:52,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:52,574 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 1 [2024-11-22 18:43:52,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:52,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-22 18:43:52,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:52,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 18:43:52,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:52,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 18:43:52,774 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 31 treesize of output 13 [2024-11-22 18:43:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:52,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:52,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1837) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-22 18:43:52,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1837) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-22 18:43:52,825 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-22 18:43:52,825 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 33 treesize of output 32 [2024-11-22 18:43:52,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem23#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))) is different from false [2024-11-22 18:43:52,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1836))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))))) is different from false [2024-11-22 18:43:52,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1835)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse3)))) is different from false [2024-11-22 18:43:52,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:52,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 68 [2024-11-22 18:43:52,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:52,897 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 6492 treesize of output 5141 [2024-11-22 18:43:52,982 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 422 treesize of output 394 [2024-11-22 18:43:52,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:52,996 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 372 treesize of output 269 [2024-11-22 18:43:53,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:53,010 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 260 treesize of output 217 [2024-11-22 18:43:53,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:53,342 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 28 treesize of output 46 [2024-11-22 18:43:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215006191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:53,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 26 [2024-11-22 18:43:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940826887] [2024-11-22 18:43:53,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 18:43:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 18:43:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=379, Unknown=7, NotChecked=220, Total=702 [2024-11-22 18:43:53,384 INFO L87 Difference]: Start difference. First operand 365 states and 442 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:54,035 INFO L93 Difference]: Finished difference Result 424 states and 505 transitions. [2024-11-22 18:43:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:43:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-22 18:43:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:54,037 INFO L225 Difference]: With dead ends: 424 [2024-11-22 18:43:54,037 INFO L226 Difference]: Without dead ends: 424 [2024-11-22 18:43:54,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=686, Unknown=7, NotChecked=300, Total=1190 [2024-11-22 18:43:54,038 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 279 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1139 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:54,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 862 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 907 Invalid, 0 Unknown, 1139 Unchecked, 0.5s Time] [2024-11-22 18:43:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-22 18:43:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 369. [2024-11-22 18:43:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.2691218130311614) internal successors, (448), 368 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 448 transitions. [2024-11-22 18:43:54,044 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 448 transitions. Word has length 53 [2024-11-22 18:43:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:54,044 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 448 transitions. [2024-11-22 18:43:54,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 448 transitions. [2024-11-22 18:43:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:43:54,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:54,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:54,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:43:54,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:54,247 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:54,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1458762867, now seen corresponding path program 1 times [2024-11-22 18:43:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119244449] [2024-11-22 18:43:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:55,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119244449] [2024-11-22 18:43:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119244449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:55,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853503061] [2024-11-22 18:43:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:55,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:55,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:55,007 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-22 18:43:55,009 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-22 18:43:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:55,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-22 18:43:55,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:55,258 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:43:55,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 18:43:55,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:55,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:55,375 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-22 18:43:55,379 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 1 [2024-11-22 18:43:55,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:55,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-22 18:43:55,464 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 30 treesize of output 13 [2024-11-22 18:43:55,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:55,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 18:43:55,526 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 30 treesize of output 13 [2024-11-22 18:43:55,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:43:55,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 18:43:55,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 18:43:55,700 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 31 treesize of output 13 [2024-11-22 18:43:55,706 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 9 treesize of output 3 [2024-11-22 18:43:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:55,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:55,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1992 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (forall ((v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))))) is different from false [2024-11-22 18:43:55,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:55,974 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 80 treesize of output 84 [2024-11-22 18:43:56,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_prenex_7) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_prenex_6) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1990) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_1991 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem23#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_prenex_5))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1991)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) is different from false [2024-11-22 18:43:56,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1990) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1989) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_ArrVal_1991 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1991)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) .cse0)) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_7) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_prenex_6) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 1))))) is different from false [2024-11-22 18:43:56,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1988))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1987) .cse0 v_prenex_7) (select (select (store .cse1 .cse0 v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_prenex_6))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1988))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1987) .cse4 v_ArrVal_1990) (select (select (store .cse5 .cse4 v_ArrVal_1989) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1992))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1988))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse6 (select (select (let ((.cse7 (store .cse8 .cse6 v_prenex_5))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1991)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))))) is different from false [2024-11-22 18:43:56,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1988))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_5))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1991)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1988))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1987) .cse6 v_prenex_7) (select (select (store .cse7 .cse6 v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_prenex_6))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1988))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1987) .cse8 v_ArrVal_1990) (select (select (store .cse9 .cse8 v_ArrVal_1989) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1992))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)))))) is different from false [2024-11-22 18:43:56,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 89 [2024-11-22 18:43:56,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-22 18:43:56,113 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 392 treesize of output 332 [2024-11-22 18:43:56,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,128 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 588 treesize of output 563 [2024-11-22 18:43:56,140 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 246 treesize of output 198 [2024-11-22 18:43:56,146 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 198 treesize of output 190 [2024-11-22 18:43:56,152 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 190 treesize of output 182 [2024-11-22 18:43:56,157 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 182 treesize of output 174 [2024-11-22 18:43:56,164 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 200 treesize of output 172 [2024-11-22 18:43:56,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 89 [2024-11-22 18:43:56,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2024-11-22 18:43:56,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:43:56,311 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 81 treesize of output 51 [2024-11-22 18:43:56,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:43:56,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:56,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-22 18:43:56,324 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 18:43:56,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2024-11-22 18:43:56,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:56,624 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 28 treesize of output 46 [2024-11-22 18:43:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:56,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853503061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:56,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2024-11-22 18:43:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224403812] [2024-11-22 18:43:56,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:56,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-22 18:43:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-22 18:43:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=898, Unknown=18, NotChecked=330, Total=1406 [2024-11-22 18:43:56,638 INFO L87 Difference]: Start difference. First operand 369 states and 448 transitions. Second operand has 38 states, 37 states have (on average 4.081081081081081) internal successors, (151), 38 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:57,921 INFO L93 Difference]: Finished difference Result 493 states and 587 transitions. [2024-11-22 18:43:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 18:43:57,922 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.081081081081081) internal successors, (151), 38 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-22 18:43:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:57,923 INFO L225 Difference]: With dead ends: 493 [2024-11-22 18:43:57,923 INFO L226 Difference]: Without dead ends: 493 [2024-11-22 18:43:57,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=475, Invalid=2074, Unknown=21, NotChecked=510, Total=3080 [2024-11-22 18:43:57,925 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 583 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1448 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:57,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1426 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1620 Invalid, 0 Unknown, 1448 Unchecked, 0.8s Time] [2024-11-22 18:43:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-22 18:43:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 373. [2024-11-22 18:43:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 357 states have (on average 1.2661064425770308) internal successors, (452), 372 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 452 transitions. [2024-11-22 18:43:57,931 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 452 transitions. Word has length 53 [2024-11-22 18:43:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:57,931 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 452 transitions. [2024-11-22 18:43:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.081081081081081) internal successors, (151), 38 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 452 transitions. [2024-11-22 18:43:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:43:57,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:57,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:57,941 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-22 18:43:58,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:58,132 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-22 18:43:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1458947566, now seen corresponding path program 1 times [2024-11-22 18:43:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933767397] [2024-11-22 18:43:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:58,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933767397] [2024-11-22 18:43:58,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933767397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:58,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391305057] [2024-11-22 18:43:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:58,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:58,731 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-22 18:43:58,732 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-22 18:43:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:58,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-22 18:43:58,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:59,074 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:43:59,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:43:59,109 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-22 18:43:59,195 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:59,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 18:43:59,265 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 18:43:59,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:43:59,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 18:43:59,432 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-22 18:43:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-22 18:43:59,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:59,515 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 51 treesize of output 27 [2024-11-22 18:43:59,524 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-22 18:43:59,597 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-22 18:43:59,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:59,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:59,667 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-22 18:43:59,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 44 [2024-11-22 18:43:59,890 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-22 18:43:59,890 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 69 [2024-11-22 18:44:00,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 18:44:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-22 18:44:00,228 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 60 treesize of output 26 [2024-11-22 18:44:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:00,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:00,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_2149) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-22 18:44:00,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_2149) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-22 18:44:02,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:44:02,994 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-22 18:44:02,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1753992 treesize of output 1582178 [2024-11-22 18:44:03,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:03,503 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 532558 treesize of output 517506 [2024-11-22 18:44:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65651 treesize of output 64051 [2024-11-22 18:44:07,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:07,901 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 67606 treesize of output 65282 [2024-11-22 18:44:08,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:08,559 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 68346 treesize of output 65238 [2024-11-22 18:44:09,251 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 64791 treesize of output 64535 [2024-11-22 18:44:10,090 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