./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:32:36,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:32:36,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:32:36,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:32:36,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:32:36,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:32:36,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:32:36,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:32:36,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:32:36,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:32:36,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:32:36,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:32:36,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:32:36,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:32:36,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:36,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:32:36,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2025-03-04 07:32:36,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:32:36,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:32:36,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:32:36,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:32:36,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:32:36,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-03-04 07:32:38,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb7e260a/24603f4410a04d6cbd5cee46bfbc1c39/FLAGa16aa4097 [2025-03-04 07:32:38,331 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:32:38,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-03-04 07:32:38,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb7e260a/24603f4410a04d6cbd5cee46bfbc1c39/FLAGa16aa4097 [2025-03-04 07:32:38,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb7e260a/24603f4410a04d6cbd5cee46bfbc1c39 [2025-03-04 07:32:38,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:32:38,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:32:38,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:38,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:32:38,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:32:38,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c76898b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38, skipping insertion in model container [2025-03-04 07:32:38,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:32:38,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:38,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:32:38,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:38,526 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:32:38,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38 WrapperNode [2025-03-04 07:32:38,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:38,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:38,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:32:38,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:32:38,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,549 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-03-04 07:32:38,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:38,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:32:38,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:32:38,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:32:38,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,575 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-04 07:32:38,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:32:38,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:32:38,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:32:38,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:32:38,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (1/1) ... [2025-03-04 07:32:38,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:38,616 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) [2025-03-04 07:32:38,619 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 [2025-03-04 07:32:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:32:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:32:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-03-04 07:32:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-03-04 07:32:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:32:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:32:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:32:38,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:32:38,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:32:38,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:32:38,844 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-04 07:32:38,845 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:32:38,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:32:38,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:32:38,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:38 BoogieIcfgContainer [2025-03-04 07:32:38,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:32:38,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:32:38,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:32:38,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:32:38,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:32:38" (1/3) ... [2025-03-04 07:32:38,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a78ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:38, skipping insertion in model container [2025-03-04 07:32:38,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:38" (2/3) ... [2025-03-04 07:32:38,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a78ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:38, skipping insertion in model container [2025-03-04 07:32:38,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:38" (3/3) ... [2025-03-04 07:32:38,864 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2025-03-04 07:32:38,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:32:38,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertionSort_recursive.i that has 2 procedures, 47 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-04 07:32:38,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:32:38,912 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;@36001698, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:32:38,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 07:32:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 43 states have internal predecessors, (49), 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) [2025-03-04 07:32:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:32:38,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:38,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:32:38,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:38,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2523184, now seen corresponding path program 1 times [2025-03-04 07:32:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886496561] [2025-03-04 07:32:38,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:32:38,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:32:38,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:38,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:39,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:39,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886496561] [2025-03-04 07:32:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886496561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218170935] [2025-03-04 07:32:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:39,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:39,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:39,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:39,043 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 43 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:39,093 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-04 07:32:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:32:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:39,098 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:32:39,098 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:32:39,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:39,101 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:39,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:32:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:32:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 41 states have internal predecessors, (45), 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) [2025-03-04 07:32:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-04 07:32:39,132 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2025-03-04 07:32:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:39,132 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-04 07:32:39,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-04 07:32:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:32:39,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:39,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:32:39,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:32:39,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash 78221072, now seen corresponding path program 1 times [2025-03-04 07:32:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003813071] [2025-03-04 07:32:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:39,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:32:39,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:32:39,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:39,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003813071] [2025-03-04 07:32:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003813071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721041612] [2025-03-04 07:32:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:39,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:39,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:39,223 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:39,250 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-04 07:32:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:32:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:39,251 INFO L225 Difference]: With dead ends: 43 [2025-03-04 07:32:39,251 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 07:32:39,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:39,252 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:39,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 07:32:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 07:32:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 39 states have internal predecessors, (43), 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) [2025-03-04 07:32:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-04 07:32:39,255 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2025-03-04 07:32:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:39,255 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-04 07:32:39,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-04 07:32:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:32:39,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:39,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:32:39,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:32:39,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:39,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 78221073, now seen corresponding path program 1 times [2025-03-04 07:32:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962168246] [2025-03-04 07:32:39,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:39,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:32:39,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:32:39,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:39,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:39,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:39,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962168246] [2025-03-04 07:32:39,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962168246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:32:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960702188] [2025-03-04 07:32:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:32:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:39,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:32:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:39,422 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:39,485 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-04 07:32:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:32:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:39,486 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:32:39,486 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:32:39,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:39,487 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:39,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:32:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-04 07:32:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 41 states have internal predecessors, (45), 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) [2025-03-04 07:32:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-04 07:32:39,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 5 [2025-03-04 07:32:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:39,495 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-04 07:32:39,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-04 07:32:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:32:39,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:39,495 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:32:39,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1883274727, now seen corresponding path program 1 times [2025-03-04 07:32:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744803568] [2025-03-04 07:32:39,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:39,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:32:39,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:32:39,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:39,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:39,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744803568] [2025-03-04 07:32:39,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744803568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:39,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457064005] [2025-03-04 07:32:39,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:39,727 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) [2025-03-04 07:32:39,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:32:39,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:32:39,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:32:39,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:39,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:39,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:32:39,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:39,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 07:32:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:39,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457064005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:40,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-04 07:32:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807101627] [2025-03-04 07:32:40,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:40,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:32:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:40,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:32:40,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:32:40,174 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:40,297 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-03-04 07:32:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:32:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:32:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:40,299 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:32:40,299 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:32:40,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:32:40,300 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:40,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:32:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-04 07:32:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 39 states have internal predecessors, (43), 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) [2025-03-04 07:32:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-04 07:32:40,306 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2025-03-04 07:32:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-04 07:32:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-04 07:32:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:32:40,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:40,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:40,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:40,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:40,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 516164209, now seen corresponding path program 1 times [2025-03-04 07:32:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455992149] [2025-03-04 07:32:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:32:40,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:32:40,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:40,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455992149] [2025-03-04 07:32:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455992149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:40,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:32:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586244084] [2025-03-04 07:32:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:40,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:32:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:40,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:32:40,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:40,579 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:40,635 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-04 07:32:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:32:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:32:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:40,636 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:32:40,636 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:32:40,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:32:40,637 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:40,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 47 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:32:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:32:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 34 states have internal predecessors, (38), 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) [2025-03-04 07:32:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-04 07:32:40,640 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 11 [2025-03-04 07:32:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-04 07:32:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-04 07:32:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:32:40,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:40,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:32:40,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 516164210, now seen corresponding path program 1 times [2025-03-04 07:32:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492672995] [2025-03-04 07:32:40,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:40,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:32:40,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:32:40,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:40,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492672995] [2025-03-04 07:32:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492672995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845722160] [2025-03-04 07:32:40,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:40,796 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) [2025-03-04 07:32:40,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:32:40,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:32:40,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:32:40,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:40,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:40,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:32:40,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:40,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:40,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 07:32:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845722160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:40,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 07:32:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826759023] [2025-03-04 07:32:40,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:40,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:32:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:40,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:32:40,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:32:40,966 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:41,135 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-04 07:32:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:32:41,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:32:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:41,137 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:32:41,137 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:32:41,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:32:41,138 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:41,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:32:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-04 07:32:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-04 07:32:41,141 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 11 [2025-03-04 07:32:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:41,142 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-04 07:32:41,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-04 07:32:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:32:41,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:41,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:41,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:41,342 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,SelfDestructingSolverStorable5 [2025-03-04 07:32:41,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1066159075, now seen corresponding path program 1 times [2025-03-04 07:32:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:41,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045642028] [2025-03-04 07:32:41,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:32:41,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:32:41,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:41,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045642028] [2025-03-04 07:32:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045642028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857060505] [2025-03-04 07:32:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:41,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:41,368 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 07:32:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:41,375 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-04 07:32:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:41,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-03-04 07:32:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:41,376 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:32:41,376 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 07:32:41,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:41,377 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:41,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 07:32:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 07:32:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.372093023255814) internal successors, (59), 48 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 07:32:41,380 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 14 [2025-03-04 07:32:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 07:32:41,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 07:32:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 07:32:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:32:41,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:41,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:32:41,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1344006099, now seen corresponding path program 1 times [2025-03-04 07:32:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277921158] [2025-03-04 07:32:41,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:41,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:32:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:32:41,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:41,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277921158] [2025-03-04 07:32:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277921158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:41,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:41,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:32:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173949660] [2025-03-04 07:32:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:32:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:41,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:32:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:32:41,445 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:41,508 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-04 07:32:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:32:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:32:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:41,509 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:32:41,509 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:32:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:32:41,510 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:41,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 132 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:32:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-04 07:32:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 44 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-04 07:32:41,515 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 15 [2025-03-04 07:32:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-04 07:32:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-04 07:32:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:32:41,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:41,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:32:41,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1285484733, now seen corresponding path program 1 times [2025-03-04 07:32:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325898739] [2025-03-04 07:32:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:41,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:32:41,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:32:41,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:41,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325898739] [2025-03-04 07:32:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325898739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248418514] [2025-03-04 07:32:41,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:41,689 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) [2025-03-04 07:32:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:32:41,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:32:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:32:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:41,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:32:41,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:41,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:32:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248418514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:41,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:32:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-04 07:32:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620662645] [2025-03-04 07:32:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:41,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:32:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:41,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:32:41,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:32:41,830 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:41,915 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-03-04 07:32:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:32:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:32:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:41,915 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:32:41,915 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:32:41,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:32:41,916 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:41,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:32:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 07:32:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-04 07:32:41,918 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 16 [2025-03-04 07:32:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:41,918 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-04 07:32:41,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-04 07:32:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:32:41,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:41,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:42,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1918312575, now seen corresponding path program 1 times [2025-03-04 07:32:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950886058] [2025-03-04 07:32:42,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:42,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:32:42,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:32:42,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:42,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950886058] [2025-03-04 07:32:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950886058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:42,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:42,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:32:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470863553] [2025-03-04 07:32:42,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:32:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:42,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:32:42,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:42,187 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-04 07:32:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:42,212 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-03-04 07:32:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:32:42,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2025-03-04 07:32:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:42,214 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:32:42,214 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 07:32:42,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:42,215 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 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 [2025-03-04 07:32:42,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 07:32:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-04 07:32:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-04 07:32:42,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2025-03-04 07:32:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:42,219 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-04 07:32:42,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-04 07:32:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-04 07:32:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:32:42,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:42,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:32:42,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1333364883, now seen corresponding path program 1 times [2025-03-04 07:32:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320654199] [2025-03-04 07:32:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:32:42,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:32:42,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320654199] [2025-03-04 07:32:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320654199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539527154] [2025-03-04 07:32:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:42,351 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) [2025-03-04 07:32:42,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:32:42,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:32:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:32:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:42,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:32:42,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:42,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:42,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539527154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:42,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:42,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-04 07:32:42,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364087474] [2025-03-04 07:32:42,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:42,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:32:42,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:42,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:32:42,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:32:42,572 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:42,672 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-03-04 07:32:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:32:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:32:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:42,675 INFO L225 Difference]: With dead ends: 78 [2025-03-04 07:32:42,675 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:32:42,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:32:42,675 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:42,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 285 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:32:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-03-04 07:32:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 62 states have internal predecessors, (66), 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) [2025-03-04 07:32:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-03-04 07:32:42,682 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 21 [2025-03-04 07:32:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-03-04 07:32:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-03-04 07:32:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:32:42,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:42,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:42,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:32:42,883 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 [2025-03-04 07:32:42,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:42,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash 883251829, now seen corresponding path program 2 times [2025-03-04 07:32:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747546181] [2025-03-04 07:32:42,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:42,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:32:42,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:32:42,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:42,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:43,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:43,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747546181] [2025-03-04 07:32:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747546181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:43,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195109119] [2025-03-04 07:32:43,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:43,270 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) [2025-03-04 07:32:43,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:32:43,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:32:43,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:32:43,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:43,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:43,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:32:43,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:43,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:32:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:43,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195109119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:43,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:43,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-04 07:32:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423613734] [2025-03-04 07:32:43,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:43,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:32:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:43,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:32:43,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:32:43,827 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 28 states, 24 states have (on average 2.625) internal successors, (63), 22 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:44,572 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-03-04 07:32:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:32:44,573 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.625) internal successors, (63), 22 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:32:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:44,573 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:32:44,573 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:32:44,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:32:44,574 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 195 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 414 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:32:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:32:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2025-03-04 07:32:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 78 states have internal predecessors, (89), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:32:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2025-03-04 07:32:44,585 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 24 [2025-03-04 07:32:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:44,585 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2025-03-04 07:32:44,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.625) internal successors, (63), 22 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2025-03-04 07:32:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:32:44,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:44,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:44,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:44,791 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,SelfDestructingSolverStorable11 [2025-03-04 07:32:44,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1422372528, now seen corresponding path program 1 times [2025-03-04 07:32:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:44,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459120656] [2025-03-04 07:32:44,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:44,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:44,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:44,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:44,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:32:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459120656] [2025-03-04 07:32:44,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459120656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:44,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859560844] [2025-03-04 07:32:44,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:44,902 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) [2025-03-04 07:32:44,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:32:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:32:44,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:32:44,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:44,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:32:44,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:32:45,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:32:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859560844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:32:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 07:32:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084532788] [2025-03-04 07:32:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:32:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:45,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:32:45,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:32:45,051 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:45,156 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-04 07:32:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:32:45,157 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:32:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:45,157 INFO L225 Difference]: With dead ends: 88 [2025-03-04 07:32:45,157 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 07:32:45,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:32:45,158 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:45,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 07:32:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 07:32:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:32:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2025-03-04 07:32:45,161 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2025-03-04 07:32:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:45,161 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2025-03-04 07:32:45,161 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2025-03-04 07:32:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:45,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:45,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:45,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:32:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:45,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2006678767, now seen corresponding path program 1 times [2025-03-04 07:32:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854315476] [2025-03-04 07:32:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:45,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:45,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:45,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854315476] [2025-03-04 07:32:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854315476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:32:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319520713] [2025-03-04 07:32:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:32:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:45,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:32:45,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:45,422 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) [2025-03-04 07:32:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:45,437 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2025-03-04 07:32:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 29 [2025-03-04 07:32:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:45,438 INFO L225 Difference]: With dead ends: 87 [2025-03-04 07:32:45,438 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:32:45,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:45,439 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:45,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:32:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2025-03-04 07:32:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-03-04 07:32:45,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 29 [2025-03-04 07:32:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-03-04 07:32:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) [2025-03-04 07:32:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-03-04 07:32:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:45,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:45,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:45,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:32:45,443 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:45,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1143876250, now seen corresponding path program 1 times [2025-03-04 07:32:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175356667] [2025-03-04 07:32:45,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:45,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:45,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:45,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:45,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175356667] [2025-03-04 07:32:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175356667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357571240] [2025-03-04 07:32:45,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:45,529 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) [2025-03-04 07:32:45,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:32:45,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:45,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:45,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:32:45,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:45,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357571240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:45,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-04 07:32:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868348521] [2025-03-04 07:32:45,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:32:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:45,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:32:45,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:32:45,643 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:45,739 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-04 07:32:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:32:45,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:32:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:45,740 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:32:45,740 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:32:45,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:32:45,740 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 103 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:45,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 110 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:32:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2025-03-04 07:32:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-04 07:32:45,742 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2025-03-04 07:32:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:45,742 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-04 07:32:45,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-04 07:32:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:32:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:45,742 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:32:45,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:32:45,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:45,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 07:32:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 598171635, now seen corresponding path program 1 times [2025-03-04 07:32:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:45,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389375041] [2025-03-04 07:32:45,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:45,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:32:45,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:32:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389375041] [2025-03-04 07:32:46,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389375041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411205374] [2025-03-04 07:32:46,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:46,231 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) [2025-03-04 07:32:46,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:32:46,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:32:46,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:32:46,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:46,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:32:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:32:46,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:46,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:32:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:32:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411205374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:46,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-03-04 07:32:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476181931] [2025-03-04 07:32:46,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:32:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:46,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:32:46,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:32:46,615 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:46,932 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-04 07:32:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:32:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 07:32:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:46,933 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:32:46,933 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:32:46,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:32:46,934 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:46,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 66 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:32:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:32:46,934 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) [2025-03-04 07:32:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:32:46,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-03-04 07:32:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:46,934 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:32:46,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:32:46,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:32:46,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2025-03-04 07:32:46,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-04 07:32:46,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-04 07:32:46,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (4 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-04 07:32:46,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-03-04 07:32:46,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:47,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:32:47,140 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:47,141 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:32:47,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:32:47 BoogieIcfgContainer [2025-03-04 07:32:47,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:32:47,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:32:47,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:32:47,143 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:32:47,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:38" (3/4) ... [2025-03-04 07:32:47,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:32:47,148 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure insertionSort [2025-03-04 07:32:47,151 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 07:32:47,151 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 07:32:47,151 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:32:47,151 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:32:47,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:32:47,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:32:47,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:32:47,201 INFO L158 Benchmark]: Toolchain (without parser) took 8832.25ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 72.0MB in the end (delta: 33.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.39ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 95.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.14ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: IcfgBuilder took 272.58ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.5MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: TraceAbstraction took 8284.52ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 77.1MB in the end (delta: 428.6kB). Peak memory consumption was 763.4kB. Max. memory is 16.1GB. [2025-03-04 07:32:47,202 INFO L158 Benchmark]: Witness Printer took 57.84ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 72.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:47,205 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.21ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.39ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 95.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.14ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 272.58ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.5MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8284.52ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 77.1MB in the end (delta: 428.6kB). Peak memory consumption was 763.4kB. Max. memory is 16.1GB. * Witness Printer took 57.84ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 72.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. 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: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 649 mSDsluCounter, 2036 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1559 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2211 IncrementalHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 477 mSDtfsCounter, 2211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 233 SyntacticMatches, 16 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=12, InterpolantAutomatonStates: 122, 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, 16 MinimizatonAttempts, 54 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 4185 SizeOfPredicates, 37 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 114/174 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:32:47,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE