./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:17:31,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:17:31,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:17:31,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:17:31,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:17:31,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:17:31,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:17:31,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:17:31,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:17:31,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:17:31,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:17:31,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:17:31,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:17:31,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:17:31,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:17:31,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:17:31,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:17:31,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:17:31,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:17:31,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:17:31,934 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:17:31,934 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:17:31,935 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:17:31,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:17:31,935 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:17:31,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:17:31,935 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:17:31,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:17:31,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:17:31,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:17:31,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:17:31,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:17:31,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:17:31,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:17:31,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:17:31,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:17:31,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:17:31,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:17:31,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:17:31,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:17:31,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:17:31,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:17:31,944 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e [2024-11-12 13:17:32,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:17:32,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:17:32,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:17:32,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:17:32,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:17:32,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2024-11-12 13:17:33,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:17:33,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:17:33,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2024-11-12 13:17:33,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f0c2755/891df36eee8943e0a711c438f0b43c74/FLAGf77a1352a [2024-11-12 13:17:33,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f0c2755/891df36eee8943e0a711c438f0b43c74 [2024-11-12 13:17:33,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:17:33,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:17:33,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:17:33,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:17:33,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:17:33,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2272526c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33, skipping insertion in model container [2024-11-12 13:17:33,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:17:33,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:17:33,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:17:33,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:17:33,671 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:17:33,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33 WrapperNode [2024-11-12 13:17:33,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:17:33,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:17:33,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:17:33,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:17:33,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,700 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-12 13:17:33,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:17:33,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:17:33,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:17:33,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:17:33,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,719 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-12 13:17:33,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:17:33,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:17:33,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:17:33,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:17:33,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (1/1) ... [2024-11-12 13:17:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:17:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:33,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:17:33,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:17:33,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 13:17:33,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:17:33,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:17:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 13:17:33,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 13:17:33,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:17:33,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:17:33,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:17:34,010 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-12 13:17:34,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:17:34,021 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:17:34,021 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 13:17:34,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:34 BoogieIcfgContainer [2024-11-12 13:17:34,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:17:34,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:17:34,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:17:34,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:17:34,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:17:33" (1/3) ... [2024-11-12 13:17:34,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20104a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:17:34, skipping insertion in model container [2024-11-12 13:17:34,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:33" (2/3) ... [2024-11-12 13:17:34,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20104a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:17:34, skipping insertion in model container [2024-11-12 13:17:34,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:34" (3/3) ... [2024-11-12 13:17:34,028 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-11-12 13:17:34,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:17:34,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-12 13:17:34,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:17:34,105 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;@4b46e78d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:17:34,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-12 13:17:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.8) internal successors, (54), 47 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:17:34,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:34,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:34,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:34,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2073277326, now seen corresponding path program 1 times [2024-11-12 13:17:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820293004] [2024-11-12 13:17:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820293004] [2024-11-12 13:17:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820293004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:34,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:17:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527695240] [2024-11-12 13:17:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:17:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:17:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:17:34,306 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.8) internal successors, (54), 47 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:34,317 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-11-12 13:17:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:17:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:17:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:34,323 INFO L225 Difference]: With dead ends: 53 [2024-11-12 13:17:34,323 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 13:17:34,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:17:34,327 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:34,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 13:17:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 13:17:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 44 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-12 13:17:34,356 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2024-11-12 13:17:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:34,357 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-12 13:17:34,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-12 13:17:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:17:34,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:34,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:34,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:17:34,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -446682608, now seen corresponding path program 1 times [2024-11-12 13:17:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220924873] [2024-11-12 13:17:34,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220924873] [2024-11-12 13:17:34,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220924873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:17:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183604244] [2024-11-12 13:17:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:17:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:17:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:17:34,509 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:34,583 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-12 13:17:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:17:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:17:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:34,585 INFO L225 Difference]: With dead ends: 44 [2024-11-12 13:17:34,585 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 13:17:34,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:17:34,587 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:34,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 13:17:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-12 13:17:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-11-12 13:17:34,595 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 11 [2024-11-12 13:17:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-12 13:17:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-11-12 13:17:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:17:34,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:34,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:17:34,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -446682607, now seen corresponding path program 1 times [2024-11-12 13:17:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71222203] [2024-11-12 13:17:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:34,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71222203] [2024-11-12 13:17:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71222203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:17:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434222856] [2024-11-12 13:17:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:34,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:17:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:17:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:17:34,922 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:35,126 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-11-12 13:17:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:17:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:17:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:35,128 INFO L225 Difference]: With dead ends: 62 [2024-11-12 13:17:35,128 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 13:17:35,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:17:35,130 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:35,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 148 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 13:17:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-12 13:17:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 52 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:17:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-11-12 13:17:35,142 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 11 [2024-11-12 13:17:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:35,143 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-12 13:17:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-12 13:17:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:17:35,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:35,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:17:35,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -962258970, now seen corresponding path program 1 times [2024-11-12 13:17:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:35,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124601151] [2024-11-12 13:17:35,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:35,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124601151] [2024-11-12 13:17:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124601151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:35,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:35,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:17:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342332105] [2024-11-12 13:17:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:17:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:17:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:17:35,365 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:35,527 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-11-12 13:17:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:17:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 13:17:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:35,528 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:17:35,530 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:17:35,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:17:35,531 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:35,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 172 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:17:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 13:17:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:17:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-11-12 13:17:35,538 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 12 [2024-11-12 13:17:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:35,538 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-11-12 13:17:35,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-11-12 13:17:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:17:35,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:35,539 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:17:35,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2045277801, now seen corresponding path program 1 times [2024-11-12 13:17:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369065994] [2024-11-12 13:17:35,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369065994] [2024-11-12 13:17:35,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369065994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177409] [2024-11-12 13:17:35,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:35,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:35,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:35,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:17:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:35,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 13:17:35,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:35,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:17:35,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:35,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:17:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-12 13:17:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277174215] [2024-11-12 13:17:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:35,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:17:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:35,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:17:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:17:35,844 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:35,953 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2024-11-12 13:17:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:17:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-12 13:17:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:35,955 INFO L225 Difference]: With dead ends: 81 [2024-11-12 13:17:35,955 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 13:17:35,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:17:35,956 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:35,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 130 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 13:17:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-11-12 13:17:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 65 states have internal predecessors, (80), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:17:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-12 13:17:35,963 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 15 [2024-11-12 13:17:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:35,963 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-12 13:17:35,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-12 13:17:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:17:35,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:35,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:35,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:17:36,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:36,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:36,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 718511440, now seen corresponding path program 1 times [2024-11-12 13:17:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455863038] [2024-11-12 13:17:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:17:36,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455863038] [2024-11-12 13:17:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455863038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:17:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956518842] [2024-11-12 13:17:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:17:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:17:36,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:17:36,386 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:36,553 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2024-11-12 13:17:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:17:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-12 13:17:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:36,554 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:17:36,556 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 13:17:36,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:17:36,556 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:36,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 13:17:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2024-11-12 13:17:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4) internal successors, (84), 68 states have internal predecessors, (84), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 13:17:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2024-11-12 13:17:36,567 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 17 [2024-11-12 13:17:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2024-11-12 13:17:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2024-11-12 13:17:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:17:36,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:36,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:17:36,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 799018136, now seen corresponding path program 1 times [2024-11-12 13:17:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17536983] [2024-11-12 13:17:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17536983] [2024-11-12 13:17:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17536983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:36,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:36,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:17:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752298677] [2024-11-12 13:17:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:36,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:17:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:36,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:17:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:17:36,630 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:36,683 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-11-12 13:17:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:17:36,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-12 13:17:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:36,685 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:17:36,685 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:17:36,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:17:36,685 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:36,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 124 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:17:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2024-11-12 13:17:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 67 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 13:17:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-12 13:17:36,692 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 18 [2024-11-12 13:17:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:36,692 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-12 13:17:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-12 13:17:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:17:36,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:36,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:36,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:17:36,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash 287878119, now seen corresponding path program 1 times [2024-11-12 13:17:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600586613] [2024-11-12 13:17:36,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:36,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600586613] [2024-11-12 13:17:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600586613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:17:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847403604] [2024-11-12 13:17:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:17:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:17:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:17:36,820 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:36,917 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2024-11-12 13:17:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:17:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-12 13:17:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:36,918 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:17:36,918 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:17:36,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:17:36,919 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:36,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 170 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:17:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:17:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 70 states have internal predecessors, (85), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 13:17:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-12 13:17:36,935 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 22 [2024-11-12 13:17:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-12 13:17:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-12 13:17:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:17:36,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:36,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:36,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:17:36,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1187692630, now seen corresponding path program 1 times [2024-11-12 13:17:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485102510] [2024-11-12 13:17:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:17:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:17:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485102510] [2024-11-12 13:17:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485102510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134138459] [2024-11-12 13:17:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:37,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:37,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:17:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:37,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:17:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:17:37,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:17:37,427 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 36 treesize of output 32 [2024-11-12 13:17:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:17:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134138459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:17:37,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:17:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-12 13:17:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188096852] [2024-11-12 13:17:37,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:17:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:17:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:17:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:17:37,489 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:37,690 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2024-11-12 13:17:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:17:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-12 13:17:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:37,691 INFO L225 Difference]: With dead ends: 100 [2024-11-12 13:17:37,692 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 13:17:37,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:17:37,692 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:37,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 223 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:17:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 13:17:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2024-11-12 13:17:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 66 states have internal predecessors, (78), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:17:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2024-11-12 13:17:37,698 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 21 [2024-11-12 13:17:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:37,698 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2024-11-12 13:17:37,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2024-11-12 13:17:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:17:37,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:37,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:37,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:17:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 13:17:37,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2005923352, now seen corresponding path program 1 times [2024-11-12 13:17:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317132064] [2024-11-12 13:17:37,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317132064] [2024-11-12 13:17:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317132064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254508606] [2024-11-12 13:17:38,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:38,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:38,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:38,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:38,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:17:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:17:38,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:38,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:17:38,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:17:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254508606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:17:38,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:17:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-12 13:17:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886273940] [2024-11-12 13:17:38,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:17:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:17:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:17:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:17:38,353 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:38,557 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-12 13:17:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:17:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-12 13:17:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:38,557 INFO L225 Difference]: With dead ends: 62 [2024-11-12 13:17:38,558 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 13:17:38,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:17:38,558 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:38,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 179 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 13:17:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-12 13:17:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 48 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:17:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-11-12 13:17:38,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 20 [2024-11-12 13:17:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:38,562 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-11-12 13:17:38,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:17:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-12 13:17:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:17:38,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:38,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:38,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:17:38,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:38,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:38,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1836234158, now seen corresponding path program 1 times [2024-11-12 13:17:38,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:38,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366441893] [2024-11-12 13:17:38,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:38,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:17:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366441893] [2024-11-12 13:17:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366441893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286506942] [2024-11-12 13:17:38,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:38,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:38,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:38,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:38,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:17:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:38,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:17:38,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:17:39,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:17:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286506942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:17:39,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-12 13:17:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251456164] [2024-11-12 13:17:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:39,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:17:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:17:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:17:39,005 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:43,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:17:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:43,160 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-12 13:17:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:17:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-12 13:17:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:43,161 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:17:43,161 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:17:43,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:17:43,162 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:43,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 173 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-12 13:17:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:17:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2024-11-12 13:17:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.196078431372549) internal successors, (61), 55 states have internal predecessors, (61), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:17:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-12 13:17:43,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 22 [2024-11-12 13:17:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:43,167 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-12 13:17:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:17:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-12 13:17:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:17:43,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:43,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:43,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 13:17:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:43,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1101083438, now seen corresponding path program 1 times [2024-11-12 13:17:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623428287] [2024-11-12 13:17:43,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:17:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623428287] [2024-11-12 13:17:43,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623428287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:43,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:43,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:17:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413130998] [2024-11-12 13:17:43,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:43,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:17:43,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:43,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:17:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:17:43,444 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:17:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:43,526 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-12 13:17:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:17:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-11-12 13:17:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:43,527 INFO L225 Difference]: With dead ends: 83 [2024-11-12 13:17:43,527 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 13:17:43,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:17:43,528 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:43,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 98 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 13:17:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-11-12 13:17:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-12 13:17:43,531 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 26 [2024-11-12 13:17:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:43,531 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-12 13:17:43,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:17:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-12 13:17:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:17:43,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:43,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:43,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:17:43,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:43,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 226150304, now seen corresponding path program 1 times [2024-11-12 13:17:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:43,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149600088] [2024-11-12 13:17:43,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:17:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149600088] [2024-11-12 13:17:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149600088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:43,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:17:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516401613] [2024-11-12 13:17:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:43,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:17:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:17:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:17:43,575 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:43,606 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-11-12 13:17:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:17:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-12 13:17:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:43,608 INFO L225 Difference]: With dead ends: 50 [2024-11-12 13:17:43,608 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 13:17:43,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:17:43,609 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:43,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 13:17:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 13:17:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-12 13:17:43,611 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 27 [2024-11-12 13:17:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:43,612 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-12 13:17:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-12 13:17:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:17:43,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:43,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:17:43,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1712886845, now seen corresponding path program 1 times [2024-11-12 13:17:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768367374] [2024-11-12 13:17:43,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:17:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768367374] [2024-11-12 13:17:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768367374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:43,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:17:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474178288] [2024-11-12 13:17:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:17:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:17:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:17:43,664 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:43,698 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-12 13:17:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:17:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-12 13:17:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:43,700 INFO L225 Difference]: With dead ends: 49 [2024-11-12 13:17:43,700 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 13:17:43,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:17:43,701 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:43,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 13:17:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-12 13:17:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-12 13:17:43,703 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2024-11-12 13:17:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:43,703 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-12 13:17:43,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-12 13:17:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:17:43,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:43,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:17:43,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:43,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 251346547, now seen corresponding path program 1 times [2024-11-12 13:17:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336699323] [2024-11-12 13:17:43,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:17:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336699323] [2024-11-12 13:17:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336699323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:43,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:17:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:17:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222618593] [2024-11-12 13:17:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:17:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:17:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:17:43,820 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:43,892 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-12 13:17:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:17:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-12 13:17:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:43,892 INFO L225 Difference]: With dead ends: 43 [2024-11-12 13:17:43,892 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 13:17:43,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:17:43,893 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:43,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 13:17:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 13:17:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-12 13:17:43,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2024-11-12 13:17:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:43,895 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-12 13:17:43,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:17:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-12 13:17:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:17:43,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:43,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:43,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:17:43,896 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:43,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -176321356, now seen corresponding path program 1 times [2024-11-12 13:17:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601669474] [2024-11-12 13:17:43,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:17:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 13:17:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:17:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:17:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601669474] [2024-11-12 13:17:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601669474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838985035] [2024-11-12 13:17:43,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:43,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:43,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:17:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:17:44,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:17:44,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:17:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838985035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:17:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:17:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-12 13:17:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076538230] [2024-11-12 13:17:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:17:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:17:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:17:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:17:44,068 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:17:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:44,110 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-12 13:17:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:17:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-12 13:17:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:44,110 INFO L225 Difference]: With dead ends: 57 [2024-11-12 13:17:44,110 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 13:17:44,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:17:44,111 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:44,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:17:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 13:17:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-12 13:17:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:17:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-12 13:17:44,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 36 [2024-11-12 13:17:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-12 13:17:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:17:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-12 13:17:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:17:44,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:44,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:44,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:17:44,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 13:17:44,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:44,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1581289454, now seen corresponding path program 1 times [2024-11-12 13:17:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:44,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338066303] [2024-11-12 13:17:44,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:17:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 13:17:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:17:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:17:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338066303] [2024-11-12 13:17:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338066303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999174862] [2024-11-12 13:17:44,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:44,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:44,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:44,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:44,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:17:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:44,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:17:44,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:17:44,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:17:44,776 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 24 treesize of output 20 [2024-11-12 13:17:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:17:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999174862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:17:44,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:17:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2024-11-12 13:17:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269861375] [2024-11-12 13:17:44,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:17:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:17:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:17:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:17:44,842 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:17:48,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:17:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:49,072 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-11-12 13:17:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:17:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 40 [2024-11-12 13:17:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:49,073 INFO L225 Difference]: With dead ends: 50 [2024-11-12 13:17:49,073 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 13:17:49,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:17:49,074 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:49,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 145 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 13:17:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 13:17:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2024-11-12 13:17:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-12 13:17:49,076 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2024-11-12 13:17:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:49,076 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-12 13:17:49,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:17:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-12 13:17:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:17:49,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:49,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:49,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:17:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 13:17:49,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1833639120, now seen corresponding path program 2 times [2024-11-12 13:17:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477739029] [2024-11-12 13:17:49,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:17:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 13:17:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 13:17:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 13:17:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 13:17:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477739029] [2024-11-12 13:17:49,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477739029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892467542] [2024-11-12 13:17:49,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:17:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:49,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:17:49,433 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:17:49,433 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:17:49,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:17:49,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 13:17:49,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:17:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 13:17:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892467542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:17:49,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:17:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-12 13:17:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981159694] [2024-11-12 13:17:49,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:17:49,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:17:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:17:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:17:49,619 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:17:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:49,683 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-11-12 13:17:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:17:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 50 [2024-11-12 13:17:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:49,683 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:17:49,684 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 13:17:49,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:17:49,684 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:49,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 136 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:17:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 13:17:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-12 13:17:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:17:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-12 13:17:49,686 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 50 [2024-11-12 13:17:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:49,686 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-12 13:17:49,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:17:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-12 13:17:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:17:49,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:17:49,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:49,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:17:49,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:49,894 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-12 13:17:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:17:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1295846774, now seen corresponding path program 3 times [2024-11-12 13:17:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:17:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075442054] [2024-11-12 13:17:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:17:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:17:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:17:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 13:17:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:17:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 13:17:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 13:17:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:17:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 13:17:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:17:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075442054] [2024-11-12 13:17:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075442054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:17:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686014678] [2024-11-12 13:17:50,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:17:50,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:17:50,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:17:50,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 13:17:50,107 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 13:17:50,107 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:17:50,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:17:50,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:17:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 13:17:50,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:17:50,386 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 13 treesize of output 11 [2024-11-12 13:17:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 13:17:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686014678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:17:50,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:17:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-11-12 13:17:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301392007] [2024-11-12 13:17:50,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:17:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:17:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:17:50,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:17:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:17:50,432 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 13:17:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:17:50,766 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-12 13:17:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:17:50,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 54 [2024-11-12 13:17:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:17:50,767 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:17:50,767 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:17:50,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2024-11-12 13:17:50,767 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:17:50,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 183 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:17:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:17:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:17:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:17:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:17:50,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2024-11-12 13:17:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:17:50,768 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:17:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 13:17:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:17:50,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:17:50,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-11-12 13:17:50,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (4 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (3 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (2 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (1 of 17 remaining) [2024-11-12 13:17:50,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-11-12 13:17:50,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:17:50,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:17:50,978 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:17:50,979 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:17:50,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:17:50 BoogieIcfgContainer [2024-11-12 13:17:50,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:17:50,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:17:50,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:17:50,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:17:50,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:34" (3/4) ... [2024-11-12 13:17:50,983 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:17:50,986 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 13:17:50,986 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 13:17:50,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-12 13:17:50,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 13:17:50,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 13:17:50,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:17:51,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:17:51,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:17:51,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:17:51,049 INFO L158 Benchmark]: Toolchain (without parser) took 17569.96ms. Allocated memory was 163.6MB in the beginning and 283.1MB in the end (delta: 119.5MB). Free memory was 91.1MB in the beginning and 241.9MB in the end (delta: -150.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.52ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 78.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.06ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 76.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: Boogie Preprocessor took 31.39ms. Allocated memory is still 163.6MB. Free memory was 76.5MB in the beginning and 74.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: RCFGBuilder took 286.67ms. Allocated memory is still 163.6MB. Free memory was 74.6MB in the beginning and 58.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: TraceAbstraction took 16957.70ms. Allocated memory was 163.6MB in the beginning and 283.1MB in the end (delta: 119.5MB). Free memory was 57.6MB in the beginning and 246.9MB in the end (delta: -189.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:17:51,050 INFO L158 Benchmark]: Witness Printer took 67.64ms. Allocated memory is still 283.1MB. Free memory was 246.9MB in the beginning and 241.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:17:51,051 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.52ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 78.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.06ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 76.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.39ms. Allocated memory is still 163.6MB. Free memory was 76.5MB in the beginning and 74.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.67ms. Allocated memory is still 163.6MB. Free memory was 74.6MB in the beginning and 58.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16957.70ms. Allocated memory was 163.6MB in the beginning and 283.1MB in the end (delta: 119.5MB). Free memory was 57.6MB in the beginning and 246.9MB in the end (delta: -189.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.64ms. Allocated memory is still 283.1MB. Free memory was 246.9MB in the beginning and 241.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 2514 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1896 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2671 IncrementalHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 618 mSDtfsCounter, 2671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 469 SyntacticMatches, 11 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 104 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 731 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 884 ConstructedInterpolants, 16 QuantifiedInterpolants, 4975 SizeOfPredicates, 30 NumberOfNonLiveVariables, 962 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 250/319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 13:17:51,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE