./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:52:08,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:52:08,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:52:08,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:52:08,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:52:08,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:52:08,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:52:08,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:52:08,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:52:08,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:52:08,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:52:08,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:52:08,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:52:08,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:52:08,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:52:08,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:52:08,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:52:08,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:52:08,693 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:52:08,693 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:52:08,693 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:52:08,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:52:08,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:52:08,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:52:08,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:52:08,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:52:08,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:52:08,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:52:08,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:52:08,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:52:08,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:52:08,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:52:08,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:52:08,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:52:08,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:52:08,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:52:08,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:52:08,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:52:08,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:52:08,701 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc [2024-10-11 17:52:08,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:52:08,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:52:08,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:52:08,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:52:08,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:52:08,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2024-10-11 17:52:10,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:52:10,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:52:10,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2024-10-11 17:52:10,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7904a1de9/26bf5b813f3548cdb5a48b62488131bc/FLAG1ffa5e0aa [2024-10-11 17:52:10,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7904a1de9/26bf5b813f3548cdb5a48b62488131bc [2024-10-11 17:52:10,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:52:10,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:52:10,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:52:10,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:52:10,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:52:10,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:52:10" (1/1) ... [2024-10-11 17:52:10,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c45a68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:10, skipping insertion in model container [2024-10-11 17:52:10,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:52:10" (1/1) ... [2024-10-11 17:52:10,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:52:11,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:52:11,077 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:52:11,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:52:11,171 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:52:11,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11 WrapperNode [2024-10-11 17:52:11,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:52:11,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:52:11,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:52:11,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:52:11,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,220 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-10-11 17:52:11,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:52:11,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:52:11,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:52:11,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:52:11,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,250 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-11 17:52:11,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:52:11,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:52:11,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:52:11,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:52:11,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (1/1) ... [2024-10-11 17:52:11,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:52:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:11,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:52:11,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:52:11,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:52:11,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:52:11,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:52:11,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:52:11,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:52:11,697 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-11 17:52:11,698 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:52:11,730 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:52:11,730 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:52:11,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:52:11 BoogieIcfgContainer [2024-10-11 17:52:11,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:52:11,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:52:11,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:52:11,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:52:11,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:52:10" (1/3) ... [2024-10-11 17:52:11,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:52:11, skipping insertion in model container [2024-10-11 17:52:11,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:11" (2/3) ... [2024-10-11 17:52:11,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:52:11, skipping insertion in model container [2024-10-11 17:52:11,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:52:11" (3/3) ... [2024-10-11 17:52:11,741 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn_malloc.i [2024-10-11 17:52:11,759 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:52:11,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-11 17:52:11,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:52:11,811 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;@2334a3c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:52:11,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-11 17:52:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 45 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-10-11 17:52:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:11,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:11,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:11,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 118370696, now seen corresponding path program 1 times [2024-10-11 17:52:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474983823] [2024-10-11 17:52:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474983823] [2024-10-11 17:52:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474983823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:12,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424627624] [2024-10-11 17:52:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:12,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:12,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:12,180 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 45 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:12,232 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-11 17:52:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-11 17:52:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:12,244 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:52:12,244 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:52:12,246 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-10-11 17:52:12,249 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:12,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:52:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 17:52:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 2.0) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-11 17:52:12,276 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 5 [2024-10-11 17:52:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:12,277 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-11 17:52:12,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-11 17:52:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:12,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:12,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:12,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:52:12,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:12,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash 118370697, now seen corresponding path program 1 times [2024-10-11 17:52:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312695213] [2024-10-11 17:52:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312695213] [2024-10-11 17:52:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312695213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:12,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315273817] [2024-10-11 17:52:12,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:12,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:12,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:12,617 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:12,663 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-11 17:52:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-11 17:52:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:12,666 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:52:12,667 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:52:12,668 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-10-11 17:52:12,669 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:12,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:52:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 17:52:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-11 17:52:12,681 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 5 [2024-10-11 17:52:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:12,682 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-11 17:52:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-11 17:52:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:12,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:12,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:12,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:52:12,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 118430279, now seen corresponding path program 1 times [2024-10-11 17:52:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484942234] [2024-10-11 17:52:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484942234] [2024-10-11 17:52:12,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484942234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:12,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692869996] [2024-10-11 17:52:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:12,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:12,909 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:12,952 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-11 17:52:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:52:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-11 17:52:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:12,953 INFO L225 Difference]: With dead ends: 45 [2024-10-11 17:52:12,954 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 17:52:12,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:12,955 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:12,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 17:52:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-10-11 17:52:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-10-11 17:52:12,963 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 5 [2024-10-11 17:52:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:12,964 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-10-11 17:52:12,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-10-11 17:52:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:12,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:12,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:12,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:52:12,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:12,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash -625475731, now seen corresponding path program 1 times [2024-10-11 17:52:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110754833] [2024-10-11 17:52:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110754833] [2024-10-11 17:52:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110754833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807819224] [2024-10-11 17:52:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:13,016 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,060 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-11 17:52:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:13,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,062 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:52:13,062 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 17:52:13,062 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-10-11 17:52:13,063 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 17:52:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 17:52:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-11 17:52:13,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 6 [2024-10-11 17:52:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,069 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-11 17:52:13,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-11 17:52:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:13,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:52:13,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -625475730, now seen corresponding path program 1 times [2024-10-11 17:52:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538444465] [2024-10-11 17:52:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538444465] [2024-10-11 17:52:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538444465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579848210] [2024-10-11 17:52:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:13,200 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,224 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-11 17:52:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,226 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:52:13,226 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:52:13,226 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-10-11 17:52:13,228 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:52:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 17:52:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-11 17:52:13,232 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 6 [2024-10-11 17:52:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-11 17:52:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-11 17:52:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:13,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:52:13,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash -625416148, now seen corresponding path program 1 times [2024-10-11 17:52:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308013143] [2024-10-11 17:52:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308013143] [2024-10-11 17:52:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308013143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868901424] [2024-10-11 17:52:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:13,348 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,378 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-11 17:52:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:52:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,380 INFO L225 Difference]: With dead ends: 43 [2024-10-11 17:52:13,380 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:52:13,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:13,381 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:52:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-10-11 17:52:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.875) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-11 17:52:13,386 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2024-10-11 17:52:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-11 17:52:13,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-10-11 17:52:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:52:13,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:52:13,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2085091202, now seen corresponding path program 1 times [2024-10-11 17:52:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971958755] [2024-10-11 17:52:13,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971958755] [2024-10-11 17:52:13,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971958755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777747394] [2024-10-11 17:52:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:13,429 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,500 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-10-11 17:52:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:52:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,507 INFO L225 Difference]: With dead ends: 38 [2024-10-11 17:52:13,507 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 17:52:13,508 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-10-11 17:52:13,508 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 17:52:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 17:52:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-11 17:52:13,519 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 7 [2024-10-11 17:52:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-11 17:52:13,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-11 17:52:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:52:13,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:52:13,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2085091203, now seen corresponding path program 1 times [2024-10-11 17:52:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598112405] [2024-10-11 17:52:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598112405] [2024-10-11 17:52:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598112405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:52:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197591878] [2024-10-11 17:52:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:52:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:52:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:13,677 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,767 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-10-11 17:52:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:52:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:52:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,769 INFO L225 Difference]: With dead ends: 53 [2024-10-11 17:52:13,770 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 17:52:13,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:13,771 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 17:52:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2024-10-11 17:52:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-10-11 17:52:13,780 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 7 [2024-10-11 17:52:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,780 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-10-11 17:52:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-10-11 17:52:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:52:13,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:52:13,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1159998232, now seen corresponding path program 1 times [2024-10-11 17:52:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825564579] [2024-10-11 17:52:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825564579] [2024-10-11 17:52:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825564579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:13,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:13,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:13,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792795838] [2024-10-11 17:52:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:13,852 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:13,899 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-11 17:52:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:52:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:13,900 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:52:13,900 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 17:52:13,900 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-10-11 17:52:13,901 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:13,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 17:52:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 17:52:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-11 17:52:13,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 10 [2024-10-11 17:52:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:13,905 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-11 17:52:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-11 17:52:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:52:13,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:13,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:13,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:52:13,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1159998231, now seen corresponding path program 1 times [2024-10-11 17:52:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816706425] [2024-10-11 17:52:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816706425] [2024-10-11 17:52:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816706425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:52:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828175396] [2024-10-11 17:52:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:52:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:52:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:14,051 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,113 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-11 17:52:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:52:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:52:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,115 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:52:14,115 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:52:14,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:14,115 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 78 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:52:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 17:52:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.5625) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-11 17:52:14,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 10 [2024-10-11 17:52:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,123 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-11 17:52:14,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-10-11 17:52:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:52:14,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:52:14,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1930730753, now seen corresponding path program 1 times [2024-10-11 17:52:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381515301] [2024-10-11 17:52:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381515301] [2024-10-11 17:52:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381515301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:14,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337424285] [2024-10-11 17:52:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:14,162 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,177 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-11 17:52:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 17:52:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,180 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:52:14,180 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 17:52:14,180 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-10-11 17:52:14,181 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 17:52:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 17:52:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-11 17:52:14,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 12 [2024-10-11 17:52:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,188 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-11 17:52:14,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-11 17:52:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:52:14,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:52:14,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -198714011, now seen corresponding path program 1 times [2024-10-11 17:52:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832108370] [2024-10-11 17:52:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832108370] [2024-10-11 17:52:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832108370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463376028] [2024-10-11 17:52:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:14,223 INFO L87 Difference]: Start difference. First operand 41 states and 49 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-10-11 17:52:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,240 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-11 17:52:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:14,241 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-10-11 17:52:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,241 INFO L225 Difference]: With dead ends: 43 [2024-10-11 17:52:14,243 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:52:14,244 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-10-11 17:52:14,244 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:52:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 17:52:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-11 17:52:14,251 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 13 [2024-10-11 17:52:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-11 17:52:14,251 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-10-11 17:52:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-11 17:52:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:14,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:52:14,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1865305850, now seen corresponding path program 1 times [2024-10-11 17:52:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230154644] [2024-10-11 17:52:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:52:14,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230154644] [2024-10-11 17:52:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230154644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:52:14,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582513737] [2024-10-11 17:52:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:52:14,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:52:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:14,402 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,480 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-11 17:52:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:52:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,482 INFO L225 Difference]: With dead ends: 52 [2024-10-11 17:52:14,482 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 17:52:14,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:52:14,483 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 147 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 17:52:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-11 17:52:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.45) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-10-11 17:52:14,488 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 14 [2024-10-11 17:52:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,488 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-10-11 17:52:14,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-10-11 17:52:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:14,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:52:14,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 6385443, now seen corresponding path program 1 times [2024-10-11 17:52:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833412233] [2024-10-11 17:52:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833412233] [2024-10-11 17:52:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833412233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230592932] [2024-10-11 17:52:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:14,538 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-10-11 17:52:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,550 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-11 17:52:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-10-11 17:52:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,551 INFO L225 Difference]: With dead ends: 48 [2024-10-11 17:52:14,551 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 17:52:14,551 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-10-11 17:52:14,552 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 17:52:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 17:52:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.425) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-10-11 17:52:14,554 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 14 [2024-10-11 17:52:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,555 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-10-11 17:52:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-10-11 17:52:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-10-11 17:52:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:14,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:52:14,556 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1842855432, now seen corresponding path program 1 times [2024-10-11 17:52:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273852694] [2024-10-11 17:52:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273852694] [2024-10-11 17:52:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273852694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:52:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69737940] [2024-10-11 17:52:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:52:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:52:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:14,708 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:14,777 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-11 17:52:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:52:14,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:14,778 INFO L225 Difference]: With dead ends: 71 [2024-10-11 17:52:14,778 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 17:52:14,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:52:14,779 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:14,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 17:52:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-10-11 17:52:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-11 17:52:14,787 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 14 [2024-10-11 17:52:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:14,787 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-11 17:52:14,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-11 17:52:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-11 17:52:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:14,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:14,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:52:14,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2101020870, now seen corresponding path program 1 times [2024-10-11 17:52:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391484450] [2024-10-11 17:52:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391484450] [2024-10-11 17:52:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391484450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786139459] [2024-10-11 17:52:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:15,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:15,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:15,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:52:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:15,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:52:15,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:15,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:52:15,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:52:15,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:52:15,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-11 17:52:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:15,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:15,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-11 17:52:15,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:52:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786139459] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:15,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2024-10-11 17:52:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323054819] [2024-10-11 17:52:15,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:52:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:52:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:52:15,838 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,729 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-10-11 17:52:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:52:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:52:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,731 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:52:17,731 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 17:52:17,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:52:17,732 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 125 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:52:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 17:52:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-11 17:52:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-10-11 17:52:17,738 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 14 [2024-10-11 17:52:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,738 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-11 17:52:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-10-11 17:52:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:52:17,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:52:17,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:52:17,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 197948852, now seen corresponding path program 1 times [2024-10-11 17:52:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917907032] [2024-10-11 17:52:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917907032] [2024-10-11 17:52:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917907032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144424427] [2024-10-11 17:52:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:17,970 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,983 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-10-11 17:52:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:17,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:52:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,984 INFO L225 Difference]: With dead ends: 58 [2024-10-11 17:52:17,984 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 17:52:17,984 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-10-11 17:52:17,985 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 17:52:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 17:52:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 57 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-10-11 17:52:17,992 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 15 [2024-10-11 17:52:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-10-11 17:52:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-10-11 17:52:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:52:17,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:52:17,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1298209327, now seen corresponding path program 1 times [2024-10-11 17:52:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139360223] [2024-10-11 17:52:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:18,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139360223] [2024-10-11 17:52:18,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139360223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114905368] [2024-10-11 17:52:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:18,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:18,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:52:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:52:18,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:18,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:52:18,515 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:52:18,516 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 19 treesize of output 16 [2024-10-11 17:52:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:18,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:18,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-11 17:52:18,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:52:18,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:52:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114905368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:18,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2024-10-11 17:52:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574203247] [2024-10-11 17:52:18,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:52:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:52:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:52:18,883 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:21,003 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2024-10-11 17:52:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:52:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:52:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:21,005 INFO L225 Difference]: With dead ends: 128 [2024-10-11 17:52:21,005 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 17:52:21,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 17:52:21,006 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 222 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:21,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 160 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:52:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 17:52:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2024-10-11 17:52:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2024-10-11 17:52:21,010 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 15 [2024-10-11 17:52:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:21,011 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2024-10-11 17:52:21,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2024-10-11 17:52:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:52:21,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:21,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:21,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:52:21,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 17:52:21,214 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:21,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1841447237, now seen corresponding path program 1 times [2024-10-11 17:52:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659447258] [2024-10-11 17:52:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659447258] [2024-10-11 17:52:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659447258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:52:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477811422] [2024-10-11 17:52:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:21,305 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:21,325 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2024-10-11 17:52:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:21,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:52:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:21,326 INFO L225 Difference]: With dead ends: 98 [2024-10-11 17:52:21,326 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 17:52:21,326 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-10-11 17:52:21,327 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:21,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 17:52:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 17:52:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 97 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-10-11 17:52:21,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 16 [2024-10-11 17:52:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:21,330 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-10-11 17:52:21,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-10-11 17:52:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:52:21,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:21,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:21,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:52:21,331 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1250289623, now seen corresponding path program 1 times [2024-10-11 17:52:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909128155] [2024-10-11 17:52:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909128155] [2024-10-11 17:52:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909128155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147961642] [2024-10-11 17:52:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:21,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:21,470 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-10-11 17:52:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:21,503 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2024-10-11 17:52:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:52:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-10-11 17:52:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:21,506 INFO L225 Difference]: With dead ends: 97 [2024-10-11 17:52:21,506 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 17:52:21,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 17:52:21,508 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:21,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 17:52:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 17:52:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.225) internal successors, (98), 81 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-10-11 17:52:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-10-11 17:52:21,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 17 [2024-10-11 17:52:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-10-11 17:52:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-10-11 17:52:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-10-11 17:52:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:52:21,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:21,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:52:21,514 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -427184541, now seen corresponding path program 2 times [2024-10-11 17:52:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032326754] [2024-10-11 17:52:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032326754] [2024-10-11 17:52:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032326754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836707747] [2024-10-11 17:52:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:52:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:21,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:21,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:52:22,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:52:22,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:22,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 17:52:22,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:22,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:52:22,721 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-11 17:52:22,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2024-10-11 17:52:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:22,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:52:23,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:52:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-11 17:52:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836707747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:23,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:23,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-10-11 17:52:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729642046] [2024-10-11 17:52:23,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 17:52:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 17:52:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=605, Unknown=1, NotChecked=0, Total=702 [2024-10-11 17:52:23,159 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:27,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:52:39,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:52:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:40,105 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2024-10-11 17:52:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:52:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 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 18 [2024-10-11 17:52:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:40,106 INFO L225 Difference]: With dead ends: 169 [2024-10-11 17:52:40,106 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 17:52:40,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=388, Invalid=1675, Unknown=7, NotChecked=0, Total=2070 [2024-10-11 17:52:40,108 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 192 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 11 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:40,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 54 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 317 Invalid, 8 Unknown, 0 Unchecked, 10.4s Time] [2024-10-11 17:52:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 17:52:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 118. [2024-10-11 17:52:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 116 states have (on average 1.3103448275862069) internal successors, (152), 117 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 152 transitions. [2024-10-11 17:52:40,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 152 transitions. Word has length 18 [2024-10-11 17:52:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:40,113 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 152 transitions. [2024-10-11 17:52:40,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 152 transitions. [2024-10-11 17:52:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:52:40,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:40,114 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:40,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:52:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:40,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:40,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -112322502, now seen corresponding path program 3 times [2024-10-11 17:52:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515624044] [2024-10-11 17:52:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515624044] [2024-10-11 17:52:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515624044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529570422] [2024-10-11 17:52:41,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:52:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:41,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:41,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:52:41,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 17:52:41,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:41,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-11 17:52:41,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:41,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:52:42,443 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-10-11 17:52:42,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-10-11 17:52:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 17:52:42,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:50,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-10-11 17:52:50,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:52:50,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-10-11 17:52:50,720 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 15 treesize of output 11 [2024-10-11 17:52:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529570422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:50,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 20] total 41 [2024-10-11 17:52:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817863503] [2024-10-11 17:52:50,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:50,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 17:52:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 17:52:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1500, Unknown=3, NotChecked=0, Total=1722 [2024-10-11 17:52:50,831 INFO L87 Difference]: Start difference. First operand 118 states and 152 transitions. Second operand has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:52,814 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2024-10-11 17:52:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:52:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 17:52:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:52,816 INFO L225 Difference]: With dead ends: 174 [2024-10-11 17:52:52,817 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 17:52:52,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=675, Invalid=3104, Unknown=3, NotChecked=0, Total=3782 [2024-10-11 17:52:52,819 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 244 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:52,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 113 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:52:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 17:52:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 66. [2024-10-11 17:52:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-10-11 17:52:52,823 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 30 [2024-10-11 17:52:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-11 17:52:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-10-11 17:52:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 17:52:52,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:52,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:52,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:52:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 17:52:53,030 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-11 17:52:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 438440715, now seen corresponding path program 2 times [2024-10-11 17:52:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676170286] [2024-10-11 17:52:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676170286] [2024-10-11 17:52:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676170286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175395359] [2024-10-11 17:52:53,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:52:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:53,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:53,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:52:53,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:52:53,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:53,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 17:52:53,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:53,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:53:09,013 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-11 17:53:09,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-10-11 17:53:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 13 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:09,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:10,009 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 44 treesize of output 38 [2024-10-11 17:53:10,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:53:10,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 44 treesize of output 34 [2024-10-11 17:53:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175395359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:10,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 19] total 47 [2024-10-11 17:53:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469322384] [2024-10-11 17:53:10,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:10,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 17:53:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:10,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 17:53:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1900, Unknown=4, NotChecked=0, Total=2256 [2024-10-11 17:53:10,089 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:53:38,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]