./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:40:57,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:40:57,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 13:40:57,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:40:57,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:40:57,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:40:57,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:40:57,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:40:57,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:40:57,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:40:57,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:40:57,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:40:57,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:40:57,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:40:57,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:40:57,475 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2025-02-06 13:40:57,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:40:57,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:40:57,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:40:57,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:40:57,745 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:40:57,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-06 13:40:58,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7822f4f1d/49823c991fab49789a616cead8ad3b90/FLAG8937ee7f5 [2025-02-06 13:40:59,190 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:40:59,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-06 13:40:59,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7822f4f1d/49823c991fab49789a616cead8ad3b90/FLAG8937ee7f5 [2025-02-06 13:40:59,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7822f4f1d/49823c991fab49789a616cead8ad3b90 [2025-02-06 13:40:59,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:40:59,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:40:59,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:40:59,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:40:59,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:40:59,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daa0f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59, skipping insertion in model container [2025-02-06 13:40:59,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:40:59,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:40:59,620 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:40:59,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:40:59,644 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:40:59,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59 WrapperNode [2025-02-06 13:40:59,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:40:59,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:40:59,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:40:59,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:40:59,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,665 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-02-06 13:40:59,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:40:59,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:40:59,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:40:59,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:40:59,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,692 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-02-06 13:40:59,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:40:59,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:40:59,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:40:59,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:40:59,703 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (1/1) ... [2025-02-06 13:40:59,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:40:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:40:59,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:40:59,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-02-06 13:40:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:40:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:40:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:40:59,796 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:40:59,797 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:40:59,906 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 13:40:59,906 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:40:59,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:40:59,912 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:40:59,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:40:59 BoogieIcfgContainer [2025-02-06 13:40:59,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:40:59,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:40:59,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:40:59,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:40:59,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:40:59" (1/3) ... [2025-02-06 13:40:59,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a70c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:40:59, skipping insertion in model container [2025-02-06 13:40:59,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:40:59" (2/3) ... [2025-02-06 13:40:59,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a70c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:40:59, skipping insertion in model container [2025-02-06 13:40:59,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:40:59" (3/3) ... [2025-02-06 13:40:59,920 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2025-02-06 13:40:59,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:40:59,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertionSort_recursive.i that has 2 procedures, 39 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-02-06 13:40:59,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:40:59,991 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=LoopHeads, 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;@357a9a0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:40:59,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 13:40:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.64) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 13:41:00,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:00,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:41:00,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:00,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash 70586633, now seen corresponding path program 1 times [2025-02-06 13:41:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279194054] [2025-02-06 13:41:00,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:41:00,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:41:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:00,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:00,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279194054] [2025-02-06 13:41:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279194054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867937610] [2025-02-06 13:41:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:00,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:00,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:00,314 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.64) internal successors, (41), 35 states have internal predecessors, (41), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:00,394 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-02-06 13:41:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 13:41:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:00,407 INFO L225 Difference]: With dead ends: 74 [2025-02-06 13:41:00,407 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 13:41:00,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:00,418 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:00,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 13:41:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 13:41:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-02-06 13:41:00,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2025-02-06 13:41:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:00,472 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-02-06 13:41:00,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-02-06 13:41:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:41:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:00,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:41:00,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:00,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1687588232, now seen corresponding path program 1 times [2025-02-06 13:41:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454189330] [2025-02-06 13:41:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:00,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:41:00,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:41:00,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:00,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454189330] [2025-02-06 13:41:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454189330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253151693] [2025-02-06 13:41:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:00,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:00,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:41:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:41:00,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:41:00,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:00,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:00,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:41:00,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:00,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253151693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:00,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:00,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:41:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590469499] [2025-02-06 13:41:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:00,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:00,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:00,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:00,790 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:00,818 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-02-06 13:41:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:41:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:41:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:00,819 INFO L225 Difference]: With dead ends: 35 [2025-02-06 13:41:00,819 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:41:00,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:00,820 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:00,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:41:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:41:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-06 13:41:00,824 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 8 [2025-02-06 13:41:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:00,824 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-06 13:41:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-06 13:41:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:41:00,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:00,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:00,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:41:01,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:01,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1949064350, now seen corresponding path program 1 times [2025-02-06 13:41:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321249998] [2025-02-06 13:41:01,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:41:01,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:41:01,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321249998] [2025-02-06 13:41:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321249998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12515538] [2025-02-06 13:41:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:41:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:01,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:41:01,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:41:01,147 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:01,159 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-02-06 13:41:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:41:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-02-06 13:41:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:01,160 INFO L225 Difference]: With dead ends: 58 [2025-02-06 13:41:01,160 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:41:01,160 INFO L434 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 [2025-02-06 13:41:01,161 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:01,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:41:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:41:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-06 13:41:01,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2025-02-06 13:41:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:01,164 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-06 13:41:01,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-06 13:41:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:41:01,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:01,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 13:41:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:41:01,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -775627637, now seen corresponding path program 1 times [2025-02-06 13:41:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938377728] [2025-02-06 13:41:01,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:41:01,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:41:01,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938377728] [2025-02-06 13:41:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938377728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037386730] [2025-02-06 13:41:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:01,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:01,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:41:01,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:41:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:41:01,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:41:01,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:01,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037386730] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:01,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:01,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:41:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109144575] [2025-02-06 13:41:01,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:01,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:41:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:01,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:41:01,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:41:01,427 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:01,463 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-02-06 13:41:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:41:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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 [2025-02-06 13:41:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:01,464 INFO L225 Difference]: With dead ends: 44 [2025-02-06 13:41:01,465 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 13:41:01,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:41:01,465 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:01,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 13:41:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 13:41:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-06 13:41:01,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 9 [2025-02-06 13:41:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:01,470 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-06 13:41:01,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-06 13:41:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:41:01,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:01,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:01,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:41:01,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:01,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2131326833, now seen corresponding path program 1 times [2025-02-06 13:41:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146751568] [2025-02-06 13:41:01,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:41:01,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:41:01,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:41:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146751568] [2025-02-06 13:41:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146751568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:41:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277939215] [2025-02-06 13:41:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:41:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:01,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:41:01,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:41:01,720 INFO L87 Difference]: Start difference. First operand 43 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) [2025-02-06 13:41:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:01,764 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-02-06 13:41:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:41:01,764 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 [2025-02-06 13:41:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:01,765 INFO L225 Difference]: With dead ends: 78 [2025-02-06 13:41:01,765 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 13:41:01,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:41:01,766 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:01,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 100 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 13:41:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-02-06 13:41:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.471698113207547) internal successors, (78), 61 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-02-06 13:41:01,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 13 [2025-02-06 13:41:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:01,770 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-02-06 13:41:01,770 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) [2025-02-06 13:41:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-02-06 13:41:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:41:01,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:01,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:01,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:41:01,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1855357725, now seen corresponding path program 1 times [2025-02-06 13:41:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142324312] [2025-02-06 13:41:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:41:01,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:41:01,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:41:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142324312] [2025-02-06 13:41:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142324312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288905930] [2025-02-06 13:41:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:41:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:01,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:41:01,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:41:01,792 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:01,799 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2025-02-06 13:41:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:41:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 13:41:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:01,800 INFO L225 Difference]: With dead ends: 104 [2025-02-06 13:41:01,800 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 13:41:01,800 INFO L434 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 [2025-02-06 13:41:01,801 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:01,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 13:41:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-02-06 13:41:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 63 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-02-06 13:41:01,805 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 16 [2025-02-06 13:41:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:01,805 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-02-06 13:41:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-02-06 13:41:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:41:01,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:01,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:01,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:41:01,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1356516480, now seen corresponding path program 1 times [2025-02-06 13:41:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008595425] [2025-02-06 13:41:01,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:41:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:41:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:41:01,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008595425] [2025-02-06 13:41:01,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008595425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:01,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:01,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:41:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257822885] [2025-02-06 13:41:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:01,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:01,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:01,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:01,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:41:01,872 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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) [2025-02-06 13:41:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:01,940 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2025-02-06 13:41:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:41:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 [2025-02-06 13:41:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:01,941 INFO L225 Difference]: With dead ends: 95 [2025-02-06 13:41:01,941 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 13:41:01,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:41:01,942 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:01,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 13:41:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-02-06 13:41:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-02-06 13:41:01,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 18 [2025-02-06 13:41:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-02-06 13:41:01,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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) [2025-02-06 13:41:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-02-06 13:41:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:41:01,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:01,949 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-02-06 13:41:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:41:01,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:01,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1812235482, now seen corresponding path program 2 times [2025-02-06 13:41:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876381347] [2025-02-06 13:41:01,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:01,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 13:41:01,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 13:41:01,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:41:01,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876381347] [2025-02-06 13:41:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876381347] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260809265] [2025-02-06 13:41:01,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:01,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:01,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:02,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:02,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:41:02,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 13:41:02,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 13:41:02,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:41:02,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:02,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:41:02,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:02,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260809265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:02,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-06 13:41:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327653701] [2025-02-06 13:41:02,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:02,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:02,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:02,091 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:02,106 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-02-06 13:41:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 13:41:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:02,109 INFO L225 Difference]: With dead ends: 52 [2025-02-06 13:41:02,109 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 13:41:02,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:41:02,110 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:02,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 13:41:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2025-02-06 13:41:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-02-06 13:41:02,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2025-02-06 13:41:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:02,113 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-02-06 13:41:02,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-02-06 13:41:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:41:02,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:02,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:02,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:41:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:02,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1134196740, now seen corresponding path program 1 times [2025-02-06 13:41:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303028277] [2025-02-06 13:41:02,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:02,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:41:02,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:41:02,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:02,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:41:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303028277] [2025-02-06 13:41:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303028277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751056358] [2025-02-06 13:41:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:02,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:02,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:02,455 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:02,515 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-02-06 13:41:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 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 22 [2025-02-06 13:41:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:02,516 INFO L225 Difference]: With dead ends: 41 [2025-02-06 13:41:02,516 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 13:41:02,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:02,522 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:02,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:41:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 13:41:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-02-06 13:41:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-02-06 13:41:02,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 22 [2025-02-06 13:41:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:02,530 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-02-06 13:41:02,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-02-06 13:41:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:41:02,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:02,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:41:02,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 800360559, now seen corresponding path program 1 times [2025-02-06 13:41:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122651307] [2025-02-06 13:41:02,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:02,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:41:02,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:41:02,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:02,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122651307] [2025-02-06 13:41:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122651307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353784851] [2025-02-06 13:41:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:02,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:41:02,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:41:02,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:41:02,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:02,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:02,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:41:02,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:02,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353784851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:03,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-02-06 13:41:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442198554] [2025-02-06 13:41:03,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:41:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:03,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:41:03,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:41:03,080 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:03,199 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-02-06 13:41:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:41:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 13:41:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:03,200 INFO L225 Difference]: With dead ends: 75 [2025-02-06 13:41:03,200 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 13:41:03,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-02-06 13:41:03,201 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:03,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 206 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:41:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 13:41:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 13:41:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) 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) [2025-02-06 13:41:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-02-06 13:41:03,204 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 23 [2025-02-06 13:41:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:03,204 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-02-06 13:41:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-02-06 13:41:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:41:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:03,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:03,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:41:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:41:03,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:03,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1647113186, now seen corresponding path program 2 times [2025-02-06 13:41:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:03,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363500033] [2025-02-06 13:41:03,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:03,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:41:03,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:41:03,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363500033] [2025-02-06 13:41:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363500033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851701299] [2025-02-06 13:41:03,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:03,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:03,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:41:03,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:41:03,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:41:03,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:03,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:03,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:41:03,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:03,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851701299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:03,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-02-06 13:41:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603224675] [2025-02-06 13:41:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:03,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:03,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:03,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:03,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:41:03,665 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:03,734 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-02-06 13:41:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:41:03,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 26 [2025-02-06 13:41:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:03,739 INFO L225 Difference]: With dead ends: 41 [2025-02-06 13:41:03,739 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 13:41:03,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:41:03,739 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:03,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 13:41:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 13:41:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2121212121212122) 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) [2025-02-06 13:41:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-06 13:41:03,746 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 26 [2025-02-06 13:41:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:03,746 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-06 13:41:03,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-06 13:41:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:41:03,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:03,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:03,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:41:03,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:41:03,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:03,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 479125327, now seen corresponding path program 1 times [2025-02-06 13:41:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986627455] [2025-02-06 13:41:03,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:03,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:41:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:41:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986627455] [2025-02-06 13:41:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986627455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26154915] [2025-02-06 13:41:04,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:04,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:04,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:41:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:41:04,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:41:04,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:04,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:04,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:41:04,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:04,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26154915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-06 13:41:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279588685] [2025-02-06 13:41:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:41:04,152 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:04,176 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-02-06 13:41:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:41:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 27 [2025-02-06 13:41:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:04,176 INFO L225 Difference]: With dead ends: 39 [2025-02-06 13:41:04,176 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 13:41:04,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:41:04,177 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:04,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 13:41:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 13:41:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-02-06 13:41:04,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2025-02-06 13:41:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:04,185 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-02-06 13:41:04,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-02-06 13:41:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 13:41:04,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:04,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:04,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:04,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:41:04,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1967983221, now seen corresponding path program 1 times [2025-02-06 13:41:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783177000] [2025-02-06 13:41:04,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:04,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:41:04,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:41:04,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:04,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 13:41:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783177000] [2025-02-06 13:41:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783177000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:41:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811791414] [2025-02-06 13:41:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:41:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:04,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:41:04,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:41:04,451 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:04,488 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-02-06 13:41:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:41:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 13:41:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:04,488 INFO L225 Difference]: With dead ends: 51 [2025-02-06 13:41:04,489 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 13:41:04,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:41:04,489 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:04,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 13:41:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-02-06 13:41:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2) internal successors, (42), 37 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) [2025-02-06 13:41:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-02-06 13:41:04,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2025-02-06 13:41:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:04,495 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-02-06 13:41:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-02-06 13:41:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 13:41:04,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:04,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:41:04,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:04,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 655168146, now seen corresponding path program 1 times [2025-02-06 13:41:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697307414] [2025-02-06 13:41:04,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:41:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:41:04,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:04,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697307414] [2025-02-06 13:41:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697307414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68273584] [2025-02-06 13:41:04,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:04,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:04,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:41:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:41:04,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:41:04,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:04,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:04,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:41:04,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:04,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68273584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:04,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:04,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:41:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12655696] [2025-02-06 13:41:04,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:04,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:41:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:04,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:41:04,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:41:04,692 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:04,748 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-02-06 13:41:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:41:04,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 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 30 [2025-02-06 13:41:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:04,749 INFO L225 Difference]: With dead ends: 94 [2025-02-06 13:41:04,750 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 13:41:04,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:41:04,751 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 83 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:04,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 196 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 13:41:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2025-02-06 13:41:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-02-06 13:41:04,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 30 [2025-02-06 13:41:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-02-06 13:41:04,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-02-06 13:41:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 13:41:04,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:04,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:04,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:04,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:04,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:04,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 655145306, now seen corresponding path program 1 times [2025-02-06 13:41:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:04,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317592076] [2025-02-06 13:41:04,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:41:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:41:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:41:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317592076] [2025-02-06 13:41:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317592076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:41:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650828405] [2025-02-06 13:41:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:41:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:05,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:41:05,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:41:05,026 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:05,065 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-02-06 13:41:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:41:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 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 30 [2025-02-06 13:41:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:05,066 INFO L225 Difference]: With dead ends: 75 [2025-02-06 13:41:05,066 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 13:41:05,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:41:05,067 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:05,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 13:41:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-02-06 13:41:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-02-06 13:41:05,071 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 30 [2025-02-06 13:41:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:05,071 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-02-06 13:41:05,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-02-06 13:41:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:41:05,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:05,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:05,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:41:05,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:05,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1165332017, now seen corresponding path program 1 times [2025-02-06 13:41:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189723779] [2025-02-06 13:41:05,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:05,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:41:05,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:41:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:41:05,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189723779] [2025-02-06 13:41:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189723779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189415384] [2025-02-06 13:41:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:05,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:05,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:05,146 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:05,166 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-02-06 13:41:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 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 [2025-02-06 13:41:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:05,167 INFO L225 Difference]: With dead ends: 85 [2025-02-06 13:41:05,167 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 13:41:05,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:05,168 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:05,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 13:41:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2025-02-06 13:41:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-02-06 13:41:05,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 31 [2025-02-06 13:41:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-02-06 13:41:05,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2025-02-06 13:41:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 13:41:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:05,173 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:41:05,173 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 522895474, now seen corresponding path program 2 times [2025-02-06 13:41:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987447293] [2025-02-06 13:41:05,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:05,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 13:41:05,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:41:05,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:05,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 13:41:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987447293] [2025-02-06 13:41:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987447293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097638390] [2025-02-06 13:41:05,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:05,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:05,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:05,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:05,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:41:05,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 13:41:05,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:41:05,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:41:05,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:05,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097638390] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:05,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2025-02-06 13:41:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16348978] [2025-02-06 13:41:05,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:41:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:05,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:41:05,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:41:05,610 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:05,998 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2025-02-06 13:41:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 13:41:05,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (5), 4 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 48 [2025-02-06 13:41:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:05,999 INFO L225 Difference]: With dead ends: 215 [2025-02-06 13:41:05,999 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 13:41:06,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 13:41:06,001 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 229 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:06,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 156 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:41:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 13:41:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2025-02-06 13:41:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 72 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-02-06 13:41:06,008 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 48 [2025-02-06 13:41:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-02-06 13:41:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-02-06 13:41:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 13:41:06,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:06,010 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:06,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:06,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 13:41:06,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:06,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1567522557, now seen corresponding path program 3 times [2025-02-06 13:41:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:06,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334272110] [2025-02-06 13:41:06,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:41:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:06,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes. [2025-02-06 13:41:06,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 13:41:06,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:41:06,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 13:41:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334272110] [2025-02-06 13:41:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334272110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035950524] [2025-02-06 13:41:06,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:41:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:06,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:06,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:41:06,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes. [2025-02-06 13:41:06,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 13:41:06,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:41:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:06,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:41:06,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:41:06,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:41:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035950524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:06,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-02-06 13:41:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411256561] [2025-02-06 13:41:06,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 13:41:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:06,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 13:41:06,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 13:41:06,876 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 34 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 9 states have call successors, (10), 9 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:07,298 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2025-02-06 13:41:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 13:41:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 9 states have call successors, (10), 9 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-06 13:41:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:07,300 INFO L225 Difference]: With dead ends: 218 [2025-02-06 13:41:07,300 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 13:41:07,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=592, Invalid=2948, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 13:41:07,302 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 637 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:07,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 344 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:41:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 13:41:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-02-06 13:41:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 143 states have (on average 1.1118881118881119) internal successors, (159), 143 states have internal predecessors, (159), 8 states have call successors, (8), 8 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2025-02-06 13:41:07,309 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 55 [2025-02-06 13:41:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:07,309 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2025-02-06 13:41:07,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 9 states have call successors, (10), 9 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2025-02-06 13:41:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 13:41:07,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:07,311 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:07,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:41:07,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 13:41:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1372321742, now seen corresponding path program 4 times [2025-02-06 13:41:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568288781] [2025-02-06 13:41:07,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:41:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:07,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-02-06 13:41:07,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 13:41:07,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:41:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 190 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:41:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568288781] [2025-02-06 13:41:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568288781] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691704092] [2025-02-06 13:41:08,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:41:08,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:08,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:08,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:08,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:41:08,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-02-06 13:41:08,677 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 13:41:08,677 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:41:08,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:08,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:41:08,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-02-06 13:41:08,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-02-06 13:41:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691704092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:09,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5, 5] total 40 [2025-02-06 13:41:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571836644] [2025-02-06 13:41:09,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 13:41:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:09,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 13:41:09,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 13:41:09,245 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 40 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 10 states have call successors, (10), 8 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:09,935 INFO L93 Difference]: Finished difference Result 308 states and 342 transitions. [2025-02-06 13:41:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 13:41:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 10 states have call successors, (10), 8 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-06 13:41:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:09,936 INFO L225 Difference]: With dead ends: 308 [2025-02-06 13:41:09,936 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:41:09,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 185 SyntacticMatches, 17 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=503, Invalid=4327, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 13:41:09,938 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 169 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:09,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 337 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:41:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:41:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:41:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:41:09,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-02-06 13:41:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:09,939 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:41:09,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 10 states have call successors, (10), 8 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:41:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:41:09,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:41:09,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-06 13:41:09,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-06 13:41:09,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-06 13:41:09,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-06 13:41:09,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-06 13:41:09,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:10,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:10,148 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:10,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:41:11,472 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:41:11,484 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-02-06 13:41:11,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:41:11 BoogieIcfgContainer [2025-02-06 13:41:11,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:41:11,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:41:11,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:41:11,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:41:11,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:40:59" (3/4) ... [2025-02-06 13:41:11,487 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:41:11,491 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure insertionSort [2025-02-06 13:41:11,493 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 13:41:11,493 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:41:11,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:41:11,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:41:11,510 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2147483646 <= \old(i)) || (i <= 2147483645)) && ((\old(i) < 1) || (1 < \old(size)))) && ((((\old(i) < \old(size)) || (\old(i) < 1)) || (4 < \old(size))) || (2147483645 <= \old(i)))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((size <= 3) || (0 < \old(i))) || (3 < \old(size)))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (3 < \old(i)))) && (((4 < \old(size)) || (1 < \old(i))) || (size <= 4))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (0 < \old(i)))) && (((i == 1) || (\old(i) < 1)) || (2 < \old(size)))) && ((3 < \old(i)) || (i <= 3))) && ((2 < \old(size)) || (size <= 2))) && ((2 < \old(i)) || (i <= 2))) && (((2 < \old(i)) || (size <= ((long) i + 2))) || (((long) \old(i) + 2) < \old(size)))) && ((i <= 2147483644) || (2147483645 <= \old(i)))) [2025-02-06 13:41:11,517 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2147483646 <= \old(i)) || (i <= 2147483645)) && ((\old(i) < 1) || (1 < \old(size)))) && ((((\old(i) < \old(size)) || (\old(i) < 1)) || (4 < \old(size))) || (2147483645 <= \old(i)))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((size <= 3) || (0 < \old(i))) || (3 < \old(size)))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (3 < \old(i)))) && (((4 < \old(size)) || (1 < \old(i))) || (size <= 4))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (0 < \old(i)))) && (((i == 1) || (\old(i) < 1)) || (2 < \old(size)))) && ((3 < \old(i)) || (i <= 3))) && ((2 < \old(size)) || (size <= 2))) && ((2 < \old(i)) || (i <= 2))) && (((2 < \old(i)) || (size <= ((long) i + 2))) || (((long) \old(i) + 2) < \old(size)))) && ((i <= 2147483644) || (2147483645 <= \old(i)))) [2025-02-06 13:41:11,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:41:11,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:41:11,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:41:11,546 INFO L158 Benchmark]: Toolchain (without parser) took 12056.25ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 106.6MB in the beginning and 144.7MB in the end (delta: -38.1MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2025-02-06 13:41:11,546 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:41:11,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.87ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:41:11,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.41ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 947.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:41:11,547 INFO L158 Benchmark]: Boogie Preprocessor took 34.18ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 906.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:41:11,547 INFO L158 Benchmark]: IcfgBuilder took 211.41ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 80.8MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:41:11,548 INFO L158 Benchmark]: TraceAbstraction took 11570.92ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.9MB in the beginning and 151.3MB in the end (delta: -71.4MB). Peak memory consumption was 145.5MB. Max. memory is 16.1GB. [2025-02-06 13:41:11,549 INFO L158 Benchmark]: Witness Printer took 59.89ms. Allocated memory is still 293.6MB. Free memory was 151.3MB in the beginning and 144.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:41:11,552 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.87ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.41ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 947.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.18ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 906.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 211.41ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 80.8MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11570.92ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.9MB in the beginning and 151.3MB in the end (delta: -71.4MB). Peak memory consumption was 145.5MB. Max. memory is 16.1GB. * Witness Printer took 59.89ms. Allocated memory is still 293.6MB. Free memory was 151.3MB in the beginning and 144.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset * 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1330 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1330 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1869 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 473 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 562 SyntacticMatches, 30 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=18, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 865 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1114 ConstructedInterpolants, 0 QuantifiedInterpolants, 2935 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1378 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 36 InterpolantComputations, 12 PerfectInterpolantSequences, 1067/1542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 15]: Location Invariant Derived location invariant: (((((((((((((((((2147483646 <= \old(i)) || (i <= 2147483645)) && ((\old(i) < 1) || (1 < \old(size)))) && ((((\old(i) < \old(size)) || (\old(i) < 1)) || (4 < \old(size))) || (2147483645 <= \old(i)))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((size <= 3) || (0 < \old(i))) || (3 < \old(size)))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (3 < \old(i)))) && (((4 < \old(size)) || (1 < \old(i))) || (size <= 4))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (0 < \old(i)))) && (((i == 1) || (\old(i) < 1)) || (2 < \old(size)))) && ((3 < \old(i)) || (i <= 3))) && ((2 < \old(size)) || (size <= 2))) && ((2 < \old(i)) || (i <= 2))) && (((2 < \old(i)) || (size <= ((long) i + 2))) || (((long) \old(i) + 2) < \old(size)))) && ((i <= 2147483644) || (2147483645 <= \old(i)))) - InvariantResult [Line: 33]: Location Invariant Derived location invariant: ((((n <= 2147483647) && (i == 0)) && (1 <= n)) || ((n <= 2147483647) && (1 <= i))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:41:11,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE