./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:37:28,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:37:28,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:37:28,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:37:28,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:37:28,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:37:28,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:37:28,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:37:28,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:37:28,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:37:28,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:37:28,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:37:28,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:37:28,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:37:28,567 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:37:28,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:37:28,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:37:28,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:37:28,568 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:37:28,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:37:28,568 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:37:28,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:37:28,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:37:28,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:37:28,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:37:28,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:37:28,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:37:28,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:37:28,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:37:28,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:37:28,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:37:28,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:37:28,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:37:28,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:37:28,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2024-11-19 06:37:28,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:37:28,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:37:28,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:37:28,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:37:28,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:37:28,829 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 [2024-11-19 06:37:30,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:37:30,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:37:30,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-11-19 06:37:30,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610181791/6539d148cc3a4abc8f324297006c508a/FLAGcee706256 [2024-11-19 06:37:30,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610181791/6539d148cc3a4abc8f324297006c508a [2024-11-19 06:37:30,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:37:30,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:37:30,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:37:30,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:37:30,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:37:30,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dd7c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30, skipping insertion in model container [2024-11-19 06:37:30,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:37:30,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:37:30,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:37:30,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:37:30,520 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:37:30,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30 WrapperNode [2024-11-19 06:37:30,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:37:30,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:37:30,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:37:30,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:37:30,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,548 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2024-11-19 06:37:30,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:37:30,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:37:30,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:37:30,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:37:30,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,574 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]. [2024-11-19 06:37:30,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:37:30,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:37:30,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:37:30,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:37:30,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (1/1) ... [2024-11-19 06:37:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:37:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:30,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:37:30,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:37:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:37:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:37:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-11-19 06:37:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-11-19 06:37:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:37:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:37:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:37:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:37:30,712 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:37:30,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:37:30,903 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-19 06:37:30,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:37:30,918 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:37:30,921 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:37:30,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:37:30 BoogieIcfgContainer [2024-11-19 06:37:30,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:37:30,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:37:30,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:37:30,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:37:30,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:37:30" (1/3) ... [2024-11-19 06:37:30,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:37:30, skipping insertion in model container [2024-11-19 06:37:30,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:37:30" (2/3) ... [2024-11-19 06:37:30,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:37:30, skipping insertion in model container [2024-11-19 06:37:30,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:37:30" (3/3) ... [2024-11-19 06:37:30,930 INFO L112 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2024-11-19 06:37:30,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:37:30,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-19 06:37:30,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:37:30,999 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;@669146d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:37:31,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 06:37:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.793103448275862) internal successors, (52), 45 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:37:31,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:31,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:37:31,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:31,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2403264, now seen corresponding path program 1 times [2024-11-19 06:37:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990227047] [2024-11-19 06:37:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990227047] [2024-11-19 06:37:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990227047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:31,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:37:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237103808] [2024-11-19 06:37:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:37:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:31,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:37:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,197 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.793103448275862) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-11-19 06:37:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:31,260 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-19 06:37:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:37:31,262 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 [2024-11-19 06:37:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:31,268 INFO L225 Difference]: With dead ends: 50 [2024-11-19 06:37:31,268 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 06:37:31,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,274 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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 [2024-11-19 06:37:31,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 06:37:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 06:37:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-11-19 06:37:31,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 4 [2024-11-19 06:37:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:31,313 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-11-19 06:37:31,313 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) [2024-11-19 06:37:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-19 06:37:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:37:31,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:31,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:37:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:37:31,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash 74502582, now seen corresponding path program 1 times [2024-11-19 06:37:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647213823] [2024-11-19 06:37:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647213823] [2024-11-19 06:37:31,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647213823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:31,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:31,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:37:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64303017] [2024-11-19 06:37:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:31,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:37:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:37:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,493 INFO L87 Difference]: Start difference. First operand 47 states and 51 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) [2024-11-19 06:37:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:31,537 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-11-19 06:37:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:37:31,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:37:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:31,539 INFO L225 Difference]: With dead ends: 45 [2024-11-19 06:37:31,539 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 06:37:31,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,540 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 65 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 [2024-11-19 06:37:31,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 65 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 06:37:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 06:37:31,548 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) [2024-11-19 06:37:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-19 06:37:31,550 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 5 [2024-11-19 06:37:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-19 06:37:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:37:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-19 06:37:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:37:31,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:31,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:37:31,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:37:31,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 74502583, now seen corresponding path program 1 times [2024-11-19 06:37:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374271081] [2024-11-19 06:37:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374271081] [2024-11-19 06:37:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374271081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:37:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802806033] [2024-11-19 06:37:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:37:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:37:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:37:31,721 INFO L87 Difference]: Start difference. First operand 45 states and 49 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) [2024-11-19 06:37:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:31,782 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-19 06:37:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:37:31,783 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 [2024-11-19 06:37:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:31,783 INFO L225 Difference]: With dead ends: 49 [2024-11-19 06:37:31,784 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 06:37:31,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:37:31,785 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:31,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 06:37:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-19 06:37:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.6) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-19 06:37:31,791 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 5 [2024-11-19 06:37:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:31,792 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-19 06:37:31,792 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) [2024-11-19 06:37:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-19 06:37:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:37:31,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:31,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:37:31,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -724328917, now seen corresponding path program 1 times [2024-11-19 06:37:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662891811] [2024-11-19 06:37:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662891811] [2024-11-19 06:37:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662891811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:37:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051283609] [2024-11-19 06:37:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:37:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:37:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,849 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-19 06:37:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:31,861 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-19 06:37:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:37:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-19 06:37:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:31,863 INFO L225 Difference]: With dead ends: 49 [2024-11-19 06:37:31,863 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 06:37:31,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:31,864 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 06:37:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-19 06:37:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-11-19 06:37:31,868 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 9 [2024-11-19 06:37:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:31,868 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-11-19 06:37:31,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-19 06:37:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-19 06:37:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:37:31,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:31,869 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:31,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:37:31,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:31,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash -675909894, now seen corresponding path program 1 times [2024-11-19 06:37:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:31,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916906293] [2024-11-19 06:37:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916906293] [2024-11-19 06:37:32,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916906293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133677753] [2024-11-19 06:37:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:32,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:32,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:37:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:32,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:37:32,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:32,230 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 [2024-11-19 06:37:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:32,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133677753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:32,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-19 06:37:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070651950] [2024-11-19 06:37:32,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:37:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:37:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:37:32,680 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:37:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:32,856 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-19 06:37:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:37:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:37:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:32,857 INFO L225 Difference]: With dead ends: 48 [2024-11-19 06:37:32,857 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 06:37:32,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:37:32,858 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:32,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 260 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:37:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 06:37:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-19 06:37:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.5517241379310345) 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) [2024-11-19 06:37:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-19 06:37:32,863 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 9 [2024-11-19 06:37:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-19 06:37:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:37:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-19 06:37:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:37:32,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:32,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:32,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:37:33,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:33,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 632480238, now seen corresponding path program 1 times [2024-11-19 06:37:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:33,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556455528] [2024-11-19 06:37:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556455528] [2024-11-19 06:37:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556455528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:37:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038731517] [2024-11-19 06:37:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:37:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:37:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:37:33,116 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-19 06:37:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:33,188 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-19 06:37:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:37:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2024-11-19 06:37:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:33,190 INFO L225 Difference]: With dead ends: 40 [2024-11-19 06:37:33,190 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 06:37:33,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:37:33,191 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 53 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:33,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 53 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:37:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 06:37:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 06:37:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-19 06:37:33,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2024-11-19 06:37:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-19 06:37:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-19 06:37:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-19 06:37:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:37:33,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:33,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:37:33,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 632480239, now seen corresponding path program 1 times [2024-11-19 06:37:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861475793] [2024-11-19 06:37:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:33,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:33,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861475793] [2024-11-19 06:37:33,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861475793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:33,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446455525] [2024-11-19 06:37:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:33,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:33,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:33,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:33,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:37:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:33,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:37:33,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:33,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:33,550 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 [2024-11-19 06:37:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:33,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446455525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:33,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-19 06:37:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638730650] [2024-11-19 06:37:33,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:33,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:37:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:37:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:37:33,570 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-11-19 06:37:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:33,706 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-19 06:37:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:37:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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 13 [2024-11-19 06:37:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:33,707 INFO L225 Difference]: With dead ends: 64 [2024-11-19 06:37:33,707 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 06:37:33,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:37:33,708 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:33,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 143 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:37:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 06:37:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2024-11-19 06:37:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 51 states have internal predecessors, (62), 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) [2024-11-19 06:37:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-11-19 06:37:33,712 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 13 [2024-11-19 06:37:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:33,712 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-11-19 06:37:33,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-11-19 06:37:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-11-19 06:37:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:37:33,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:33,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:33,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:37:33,913 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,SelfDestructingSolverStorable6 [2024-11-19 06:37:33,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 237368811, now seen corresponding path program 1 times [2024-11-19 06:37:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113279700] [2024-11-19 06:37:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:37:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113279700] [2024-11-19 06:37:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113279700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:37:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693725276] [2024-11-19 06:37:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:37:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:33,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:37:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:33,933 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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) [2024-11-19 06:37:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:33,940 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-19 06:37:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:37:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 [2024-11-19 06:37:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:33,941 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:37:33,941 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:37:33,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:37:33,942 INFO L432 NwaCegarLoop]: 38 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, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:33,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:37:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 06:37:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 50 states have internal predecessors, (61), 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) [2024-11-19 06:37:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-19 06:37:33,949 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 16 [2024-11-19 06:37:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:33,949 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-19 06:37:33,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:37:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-19 06:37:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:37:33,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:33,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:33,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:37:33,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:33,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1818852628, now seen corresponding path program 1 times [2024-11-19 06:37:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415532440] [2024-11-19 06:37:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:37:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415532440] [2024-11-19 06:37:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415532440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:37:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731259879] [2024-11-19 06:37:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:34,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:37:34,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:37:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:37:34,007 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-19 06:37:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:34,070 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-19 06:37:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:37:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2024-11-19 06:37:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:34,071 INFO L225 Difference]: With dead ends: 53 [2024-11-19 06:37:34,071 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 06:37:34,071 INFO L431 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 [2024-11-19 06:37:34,072 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 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 [2024-11-19 06:37:34,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 06:37:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-19 06:37:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 46 states have internal predecessors, (52), 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) [2024-11-19 06:37:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-19 06:37:34,076 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 17 [2024-11-19 06:37:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:34,076 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-19 06:37:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-19 06:37:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-19 06:37:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:37:34,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:34,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:37:34,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash 549862643, now seen corresponding path program 1 times [2024-11-19 06:37:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356199984] [2024-11-19 06:37:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356199984] [2024-11-19 06:37:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356199984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960847818] [2024-11-19 06:37:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:34,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:34,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:37:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:37:34,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:37:34,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:37:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960847818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:37:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-19 06:37:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730820041] [2024-11-19 06:37:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:34,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:37:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:37:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:37:34,375 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-19 06:37:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:34,465 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-19 06:37:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:37:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2024-11-19 06:37:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:34,466 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:37:34,466 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:37:34,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:37:34,467 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:34,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 148 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:37:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 06:37:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 46 states have internal predecessors, (51), 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) [2024-11-19 06:37:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-19 06:37:34,470 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 18 [2024-11-19 06:37:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:34,470 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-19 06:37:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-19 06:37:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-19 06:37:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:37:34,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:34,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:34,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:37:34,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:34,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 478164206, now seen corresponding path program 1 times [2024-11-19 06:37:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795066747] [2024-11-19 06:37:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:37:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795066747] [2024-11-19 06:37:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795066747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:34,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:37:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942881021] [2024-11-19 06:37:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:34,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:37:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:37:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:37:34,728 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:37:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:34,750 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-19 06:37:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:37:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2024-11-19 06:37:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:34,752 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:37:34,752 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 06:37:34,752 INFO L431 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 [2024-11-19 06:37:34,753 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:34,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 06:37:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-19 06:37:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 46 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) [2024-11-19 06:37:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-19 06:37:34,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 18 [2024-11-19 06:37:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:34,756 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-19 06:37:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:37:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-19 06:37:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:37:34,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:34,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:37:34,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1801951558, now seen corresponding path program 1 times [2024-11-19 06:37:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279660127] [2024-11-19 06:37:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:34,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279660127] [2024-11-19 06:37:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279660127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76139036] [2024-11-19 06:37:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:34,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:34,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:34,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:34,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:37:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:34,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:37:34,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:35,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76139036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:35,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-11-19 06:37:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841032957] [2024-11-19 06:37:35,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:35,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:37:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:37:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:37:35,095 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 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) [2024-11-19 06:37:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:35,201 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-19 06:37:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:37:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 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 23 [2024-11-19 06:37:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:35,203 INFO L225 Difference]: With dead ends: 83 [2024-11-19 06:37:35,203 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 06:37:35,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:37:35,203 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:35,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 378 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:37:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 06:37:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2024-11-19 06:37:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 66 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:37:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-11-19 06:37:35,207 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 23 [2024-11-19 06:37:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-11-19 06:37:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 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) [2024-11-19 06:37:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-11-19 06:37:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:37:35,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:35,208 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:35,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:37:35,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:35,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:35,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 687311817, now seen corresponding path program 2 times [2024-11-19 06:37:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:35,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844411238] [2024-11-19 06:37:35,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:37:35,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:35,424 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:37:35,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:37:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:37:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844411238] [2024-11-19 06:37:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844411238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859211785] [2024-11-19 06:37:35,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:37:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:35,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:35,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:37:35,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:37:35,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:37:35,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:37:35,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:35,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:37:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:36,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:37:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859211785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:36,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-11-19 06:37:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968474751] [2024-11-19 06:37:36,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:36,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:37:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:37:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:37:36,330 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 28 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 22 states have internal predecessors, (70), 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) [2024-11-19 06:37:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:37,158 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2024-11-19 06:37:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:37:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 22 states have internal predecessors, (70), 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 27 [2024-11-19 06:37:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:37,159 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:37:37,159 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:37:37,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 06:37:37,160 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 213 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:37,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 442 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:37:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:37:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-19 06:37:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 82 states have internal predecessors, (93), 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) [2024-11-19 06:37:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-11-19 06:37:37,164 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 27 [2024-11-19 06:37:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-11-19 06:37:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 22 states have internal predecessors, (70), 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) [2024-11-19 06:37:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-11-19 06:37:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:37:37,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:37,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:37,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:37:37,370 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,SelfDestructingSolverStorable12 [2024-11-19 06:37:37,371 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1979180263, now seen corresponding path program 1 times [2024-11-19 06:37:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043579440] [2024-11-19 06:37:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:37:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043579440] [2024-11-19 06:37:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043579440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:37:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:37:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665023180] [2024-11-19 06:37:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:37:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:37:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:37:37,437 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:37,459 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2024-11-19 06:37:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:37:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 31 [2024-11-19 06:37:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:37,460 INFO L225 Difference]: With dead ends: 92 [2024-11-19 06:37:37,460 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 06:37:37,461 INFO L431 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 [2024-11-19 06:37:37,461 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:37,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 06:37:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2024-11-19 06:37:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 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) [2024-11-19 06:37:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-19 06:37:37,463 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2024-11-19 06:37:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:37,464 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-19 06:37:37,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:37:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-19 06:37:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:37:37,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:37,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:37,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:37:37,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2026788370, now seen corresponding path program 1 times [2024-11-19 06:37:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838236775] [2024-11-19 06:37:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:37:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838236775] [2024-11-19 06:37:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838236775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022435768] [2024-11-19 06:37:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:37,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:37,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:37:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:37,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:37:37,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:37:37,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:37:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022435768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:37:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:37:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-11-19 06:37:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102164102] [2024-11-19 06:37:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:37:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:37:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:37:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:37:37,759 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-11-19 06:37:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:37,859 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-19 06:37:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:37:37,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 31 [2024-11-19 06:37:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:37,860 INFO L225 Difference]: With dead ends: 40 [2024-11-19 06:37:37,860 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 06:37:37,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:37:37,860 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:37,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 61 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:37:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 06:37:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-19 06:37:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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) [2024-11-19 06:37:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-19 06:37:37,864 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 31 [2024-11-19 06:37:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:37,865 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-19 06:37:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-11-19 06:37:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-19 06:37:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:37:37,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:37,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:37,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:37:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 06:37:38,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:38,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1594075993, now seen corresponding path program 1 times [2024-11-19 06:37:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77060713] [2024-11-19 06:37:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:37:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77060713] [2024-11-19 06:37:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77060713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021553973] [2024-11-19 06:37:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:38,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:38,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:38,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:37:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:38,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:37:38,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:37:38,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:37:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021553973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:38,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-19 06:37:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891911954] [2024-11-19 06:37:38,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:37:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:38,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:37:38,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:37:38,316 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 8 states have internal predecessors, (35), 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) [2024-11-19 06:37:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:38,411 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-19 06:37:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:37:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 8 states have internal predecessors, (35), 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 32 [2024-11-19 06:37:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:38,412 INFO L225 Difference]: With dead ends: 51 [2024-11-19 06:37:38,412 INFO L226 Difference]: Without dead ends: 51 [2024-11-19 06:37:38,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:37:38,413 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:38,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:37:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-19 06:37:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-11-19 06:37:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2024-11-19 06:37:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-19 06:37:38,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2024-11-19 06:37:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-19 06:37:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 8 states have internal predecessors, (35), 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) [2024-11-19 06:37:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-19 06:37:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:37:38,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:37:38,416 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:38,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:37:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:38,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-11-19 06:37:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:37:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1918708772, now seen corresponding path program 1 times [2024-11-19 06:37:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:37:38,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41150710] [2024-11-19 06:37:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:37:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:37:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:37:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41150710] [2024-11-19 06:37:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41150710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:37:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045992695] [2024-11-19 06:37:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:37:38,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:37:38,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:37:38,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:37:38,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:37:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:37:38,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:37:38,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:37:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:37:39,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:37:39,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:37:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:37:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045992695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:37:39,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:37:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2024-11-19 06:37:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845463589] [2024-11-19 06:37:39,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:37:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:37:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:37:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:37:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:37:39,352 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 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) [2024-11-19 06:37:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:37:39,686 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-19 06:37:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:37:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 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 40 [2024-11-19 06:37:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:37:39,687 INFO L225 Difference]: With dead ends: 49 [2024-11-19 06:37:39,687 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:37:39,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 06:37:39,689 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 94 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:37:39,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 99 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:37:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:37:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:37:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:37:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:37:39,689 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-11-19 06:37:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:37:39,689 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:37:39,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 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) [2024-11-19 06:37:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:37:39,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:37:39,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2024-11-19 06:37:39,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2024-11-19 06:37:39,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2024-11-19 06:37:39,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2024-11-19 06:37:39,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2024-11-19 06:37:39,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2024-11-19 06:37:39,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (1 of 16 remaining) [2024-11-19 06:37:39,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2024-11-19 06:37:39,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:37:39,896 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,SelfDestructingSolverStorable16 [2024-11-19 06:37:39,899 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:37:39,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:37:39,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:37:39 BoogieIcfgContainer [2024-11-19 06:37:39,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:37:39,903 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:37:39,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:37:39,904 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:37:39,904 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:37:30" (3/4) ... [2024-11-19 06:37:39,906 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:37:39,909 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure insertionSort [2024-11-19 06:37:39,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 06:37:39,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 06:37:39,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 06:37:39,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:37:39,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:37:39,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:37:39,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:37:39,981 INFO L158 Benchmark]: Toolchain (without parser) took 9707.02ms. Allocated memory was 132.1MB in the beginning and 201.3MB in the end (delta: 69.2MB). Free memory was 64.5MB in the beginning and 72.7MB in the end (delta: -8.2MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,982 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 90.2MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:37:39,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.47ms. Allocated memory is still 132.1MB. Free memory was 64.3MB in the beginning and 96.1MB in the end (delta: -31.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 132.1MB. Free memory was 96.1MB in the beginning and 94.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:37:39,982 INFO L158 Benchmark]: Boogie Preprocessor took 37.97ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,982 INFO L158 Benchmark]: RCFGBuilder took 334.11ms. Allocated memory is still 132.1MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,983 INFO L158 Benchmark]: TraceAbstraction took 8980.27ms. Allocated memory was 132.1MB in the beginning and 201.3MB in the end (delta: 69.2MB). Free memory was 77.3MB in the beginning and 76.8MB in the end (delta: 515.8kB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,983 INFO L158 Benchmark]: Witness Printer took 77.59ms. Allocated memory is still 201.3MB. Free memory was 76.8MB in the beginning and 72.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:37:39,984 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.53ms. Allocated memory is still 90.2MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.47ms. Allocated memory is still 132.1MB. Free memory was 64.3MB in the beginning and 96.1MB in the end (delta: -31.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 132.1MB. Free memory was 96.1MB in the beginning and 94.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.97ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.11ms. Allocated memory is still 132.1MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8980.27ms. Allocated memory was 132.1MB in the beginning and 201.3MB in the end (delta: 69.2MB). Free memory was 77.3MB in the beginning and 76.8MB in the end (delta: 515.8kB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 77.59ms. Allocated memory is still 201.3MB. Free memory was 76.8MB in the beginning and 72.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 2468 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1911 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2256 IncrementalHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 557 mSDtfsCounter, 2256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 267 SyntacticMatches, 16 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=13, InterpolantAutomatonStates: 126, 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, 17 MinimizatonAttempts, 60 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 4466 SizeOfPredicates, 37 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 124/185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:37:40,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE