./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-e2fb8be-m [2025-03-09 01:55:21,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:55:21,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:55:21,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:55:21,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:55:21,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:55:21,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:55:21,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:55:21,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:55:21,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:55:21,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:55:21,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:55:21,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:55:21,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:55:21,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:21,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:55:21,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-09 01:55:21,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:55:21,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:55:21,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:55:21,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:55:21,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:55:21,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-03-09 01:55:22,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c529577/b6794e34d7304166afe528129576d7ea/FLAGaf5e8589c [2025-03-09 01:55:23,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:55:23,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-03-09 01:55:23,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c529577/b6794e34d7304166afe528129576d7ea/FLAGaf5e8589c [2025-03-09 01:55:23,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c529577/b6794e34d7304166afe528129576d7ea [2025-03-09 01:55:23,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:55:23,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:55:23,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:23,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:55:23,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:55:23,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740d2ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23, skipping insertion in model container [2025-03-09 01:55:23,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:55:23,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:23,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:55:23,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:23,581 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:55:23,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23 WrapperNode [2025-03-09 01:55:23,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:23,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:23,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:55:23,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:55:23,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,603 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-03-09 01:55:23,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:23,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:55:23,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:55:23,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:55:23,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,624 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-09 01:55:23,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:55:23,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:55:23,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:55:23,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:55:23,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (1/1) ... [2025-03-09 01:55:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:23,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:55:23,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:55:23,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:55:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:55:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-03-09 01:55:23,684 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-03-09 01:55:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:55:23,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:55:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:55:23,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:55:23,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:55:23,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:55:23,886 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-09 01:55:23,886 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:55:23,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:55:23,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:55:23,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:23 BoogieIcfgContainer [2025-03-09 01:55:23,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:55:23,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:55:23,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:55:23,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:55:23,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:55:23" (1/3) ... [2025-03-09 01:55:23,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5234d21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:23, skipping insertion in model container [2025-03-09 01:55:23,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:23" (2/3) ... [2025-03-09 01:55:23,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5234d21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:23, skipping insertion in model container [2025-03-09 01:55:23,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:23" (3/3) ... [2025-03-09 01:55:23,906 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2025-03-09 01:55:23,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:55:23,918 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-03-09 01:55:23,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:55:23,973 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;@24efcc74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:55:23,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:55:23,978 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-03-09 01:55:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:55:23,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:23,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:55:23,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 70586633, now seen corresponding path program 1 times [2025-03-09 01:55:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163531544] [2025-03-09 01:55:23,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:24,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:55:24,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:55:24,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163531544] [2025-03-09 01:55:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163531544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944689862] [2025-03-09 01:55:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:24,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:24,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:24,172 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-03-09 01:55:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:24,215 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-09 01:55:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:24,217 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-03-09 01:55:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:24,221 INFO L225 Difference]: With dead ends: 74 [2025-03-09 01:55:24,221 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:55:24,223 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-03-09 01:55:24,225 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-03-09 01:55:24,226 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-03-09 01:55:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:55:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 01:55:24,250 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-03-09 01:55:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-09 01:55:24,256 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2025-03-09 01:55:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:24,257 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-09 01:55:24,257 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-03-09 01:55:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-09 01:55:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:55:24,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:24,257 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:24,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:55:24,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1687588232, now seen corresponding path program 1 times [2025-03-09 01:55:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118667689] [2025-03-09 01:55:24,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:24,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:55:24,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:55:24,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118667689] [2025-03-09 01:55:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118667689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928657341] [2025-03-09 01:55:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:24,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:24,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:55:24,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:55:24,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:55:24,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:24,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928657341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:24,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:55:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015421241] [2025-03-09 01:55:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:24,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:24,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:24,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:24,453 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-03-09 01:55:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:24,480 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-03-09 01:55:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:24,481 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-03-09 01:55:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:24,482 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:55:24,482 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:55:24,483 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-03-09 01:55:24,483 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-03-09 01:55:24,483 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-03-09 01:55:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:55:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 01:55:24,486 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-03-09 01:55:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-09 01:55:24,487 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 8 [2025-03-09 01:55:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-09 01:55:24,487 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-03-09 01:55:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-09 01:55:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:55:24,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:24,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:24,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:55:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:24,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1949064350, now seen corresponding path program 1 times [2025-03-09 01:55:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650086659] [2025-03-09 01:55:24,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:24,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:55:24,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:55:24,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650086659] [2025-03-09 01:55:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650086659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103199012] [2025-03-09 01:55:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:24,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:24,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:24,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:24,739 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-03-09 01:55:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:24,748 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-03-09 01:55:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:24,748 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-03-09 01:55:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:24,749 INFO L225 Difference]: With dead ends: 58 [2025-03-09 01:55:24,749 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:55:24,749 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-03-09 01:55:24,750 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-03-09 01:55:24,750 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-03-09 01:55:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:55:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 01:55:24,752 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-03-09 01:55:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-09 01:55:24,753 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2025-03-09 01:55:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:24,753 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-09 01:55:24,753 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-03-09 01:55:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-09 01:55:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:55:24,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:24,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:55:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:55:24,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:24,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash -775627637, now seen corresponding path program 1 times [2025-03-09 01:55:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394942056] [2025-03-09 01:55:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:24,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:55:24,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:55:24,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394942056] [2025-03-09 01:55:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394942056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944433738] [2025-03-09 01:55:24,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:24,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:24,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:55:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:55:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:55:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:24,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:24,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944433738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:24,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:55:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189150810] [2025-03-09 01:55:24,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:55:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:24,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:55:24,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:24,999 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-03-09 01:55:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:25,044 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-09 01:55:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:55:25,045 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-03-09 01:55:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:25,047 INFO L225 Difference]: With dead ends: 44 [2025-03-09 01:55:25,047 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 01:55:25,047 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-03-09 01:55:25,048 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-03-09 01:55:25,048 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-03-09 01:55:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 01:55:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 01:55:25,052 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-03-09 01:55:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-09 01:55:25,054 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 9 [2025-03-09 01:55:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 01:55:25,054 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-03-09 01:55:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-09 01:55:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:55:25,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:25,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:25,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:55:25,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:55:25,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:25,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2131326833, now seen corresponding path program 1 times [2025-03-09 01:55:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:25,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929022308] [2025-03-09 01:55:25,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:55:25,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:55:25,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:25,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:55:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929022308] [2025-03-09 01:55:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929022308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:55:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151026396] [2025-03-09 01:55:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:25,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:25,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:55:25,311 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-03-09 01:55:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:25,363 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-09 01:55:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:25,364 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-03-09 01:55:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:25,364 INFO L225 Difference]: With dead ends: 78 [2025-03-09 01:55:25,364 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 01:55:25,365 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-03-09 01:55:25,366 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-03-09 01:55:25,367 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-03-09 01:55:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 01:55:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-03-09 01:55:25,371 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-03-09 01:55:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-09 01:55:25,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 13 [2025-03-09 01:55:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-09 01:55:25,372 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-03-09 01:55:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-09 01:55:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:55:25,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:25,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:25,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:55:25,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1855357725, now seen corresponding path program 1 times [2025-03-09 01:55:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658914687] [2025-03-09 01:55:25,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:25,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:55:25,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:55:25,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:25,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:55:25,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:25,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658914687] [2025-03-09 01:55:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658914687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:25,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479174903] [2025-03-09 01:55:25,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:25,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:25,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:25,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:25,403 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-03-09 01:55:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:25,414 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2025-03-09 01:55:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:25,414 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-03-09 01:55:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:25,415 INFO L225 Difference]: With dead ends: 104 [2025-03-09 01:55:25,415 INFO L226 Difference]: Without dead ends: 67 [2025-03-09 01:55:25,415 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-03-09 01:55:25,415 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-03-09 01:55:25,416 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-03-09 01:55:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-09 01:55:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-09 01:55:25,421 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-03-09 01:55:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-09 01:55:25,422 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 16 [2025-03-09 01:55:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:25,422 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-09 01:55:25,422 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-03-09 01:55:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-09 01:55:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:55:25,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:25,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:25,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:55:25,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:25,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1356516480, now seen corresponding path program 1 times [2025-03-09 01:55:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108106886] [2025-03-09 01:55:25,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:25,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:55:25,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:55:25,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:25,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:55:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108106886] [2025-03-09 01:55:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108106886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:25,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:55:25,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207897225] [2025-03-09 01:55:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:25,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:25,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:25,506 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-03-09 01:55:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:25,574 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2025-03-09 01:55:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:55:25,575 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-03-09 01:55:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:25,575 INFO L225 Difference]: With dead ends: 95 [2025-03-09 01:55:25,575 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 01:55:25,576 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-03-09 01:55:25,576 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-03-09 01:55:25,576 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-03-09 01:55:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 01:55:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-09 01:55:25,579 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-03-09 01:55:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-09 01:55:25,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 18 [2025-03-09 01:55:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-09 01:55:25,580 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-03-09 01:55:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-09 01:55:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:55:25,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:25,581 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:55:25,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:55:25,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1812235482, now seen corresponding path program 2 times [2025-03-09 01:55:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255182963] [2025-03-09 01:55:25,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:25,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:55:25,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:55:25,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:55:25,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:55:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255182963] [2025-03-09 01:55:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255182963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972355260] [2025-03-09 01:55:25,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:25,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:25,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:55:25,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:55:25,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:55:25,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:55:25,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:55:25,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:55:25,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:55:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972355260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:25,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-09 01:55:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083824926] [2025-03-09 01:55:25,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:25,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:25,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:25,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:25,697 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-03-09 01:55:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:25,710 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-09 01:55:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:25,710 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-03-09 01:55:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:25,711 INFO L225 Difference]: With dead ends: 52 [2025-03-09 01:55:25,711 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:55:25,711 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-03-09 01:55:25,711 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-03-09 01:55:25,711 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-03-09 01:55:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:55:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2025-03-09 01:55:25,713 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-03-09 01:55:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-09 01:55:25,714 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2025-03-09 01:55:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:25,714 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-09 01:55:25,714 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-03-09 01:55:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-09 01:55:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:55:25,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:25,714 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-03-09 01:55:25,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:25,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:25,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1134196740, now seen corresponding path program 1 times [2025-03-09 01:55:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:25,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415286772] [2025-03-09 01:55:25,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:25,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:55:25,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:55:25,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:25,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:55:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415286772] [2025-03-09 01:55:25,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415286772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:25,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:25,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:25,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714341200] [2025-03-09 01:55:25,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:25,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:25,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:25,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:25,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:25,978 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-03-09 01:55:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:26,001 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-03-09 01:55:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:26,001 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-03-09 01:55:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:26,001 INFO L225 Difference]: With dead ends: 41 [2025-03-09 01:55:26,002 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 01:55:26,002 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-03-09 01:55:26,003 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:26,003 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.0s Time] [2025-03-09 01:55:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 01:55:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-09 01:55:26,007 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-03-09 01:55:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-09 01:55:26,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 22 [2025-03-09 01:55:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-09 01:55:26,008 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-03-09 01:55:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-09 01:55:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:55:26,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:26,009 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-03-09 01:55:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:55:26,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 800360559, now seen corresponding path program 1 times [2025-03-09 01:55:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388947667] [2025-03-09 01:55:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:26,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:55:26,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:55:26,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:26,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388947667] [2025-03-09 01:55:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388947667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263070792] [2025-03-09 01:55:26,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:26,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:26,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:55:26,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:55:26,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:55:26,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:26,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:55:26,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:26,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263070792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:26,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-03-09 01:55:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999091728] [2025-03-09 01:55:26,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:26,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:55:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:26,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:55:26,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:55:26,487 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-03-09 01:55:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:26,594 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-09 01:55:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:55:26,595 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-03-09 01:55:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:26,596 INFO L225 Difference]: With dead ends: 75 [2025-03-09 01:55:26,596 INFO L226 Difference]: Without dead ends: 41 [2025-03-09 01:55:26,596 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-03-09 01:55:26,597 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-09 01:55:26,597 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-03-09 01:55:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-09 01:55:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-09 01:55:26,602 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-03-09 01:55:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-03-09 01:55:26,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 23 [2025-03-09 01:55:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-03-09 01:55:26,605 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-03-09 01:55:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-03-09 01:55:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:55:26,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:26,606 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-03-09 01:55:26,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:55:26,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:26,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:26,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1647113186, now seen corresponding path program 2 times [2025-03-09 01:55:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:26,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126865324] [2025-03-09 01:55:26,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:26,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:55:26,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:55:26,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:26,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126865324] [2025-03-09 01:55:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126865324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614867663] [2025-03-09 01:55:26,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:26,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:26,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:26,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:55:26,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:55:26,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:55:26,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:26,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:26,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:55:26,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:26,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614867663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:26,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-09 01:55:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397139160] [2025-03-09 01:55:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:26,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:26,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:26,979 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-03-09 01:55:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:27,020 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-03-09 01:55:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:27,020 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-03-09 01:55:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:27,021 INFO L225 Difference]: With dead ends: 41 [2025-03-09 01:55:27,021 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 01:55:27,021 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-03-09 01:55:27,023 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-03-09 01:55:27,023 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-03-09 01:55:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 01:55:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 01:55:27,026 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-03-09 01:55:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-09 01:55:27,026 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 26 [2025-03-09 01:55:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-09 01:55:27,026 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-03-09 01:55:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-09 01:55:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 01:55:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:27,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:27,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:27,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:55:27,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash 479125327, now seen corresponding path program 1 times [2025-03-09 01:55:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445807473] [2025-03-09 01:55:27,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:27,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:55:27,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:55:27,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:27,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445807473] [2025-03-09 01:55:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445807473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264889768] [2025-03-09 01:55:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:27,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:27,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:27,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:27,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:55:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:55:27,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:55:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:27,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:27,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:27,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:27,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264889768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-09 01:55:27,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186906703] [2025-03-09 01:55:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:27,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:27,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:55:27,393 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-03-09 01:55:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:27,418 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-09 01:55:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:27,418 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-03-09 01:55:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:27,419 INFO L225 Difference]: With dead ends: 39 [2025-03-09 01:55:27,419 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 01:55:27,419 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-03-09 01:55:27,419 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-03-09 01:55:27,420 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-03-09 01:55:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 01:55:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 01:55:27,426 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-03-09 01:55:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-09 01:55:27,426 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2025-03-09 01:55:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:27,426 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-09 01:55:27,426 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-03-09 01:55:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-09 01:55:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:55:27,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:27,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:27,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:55:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:27,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:27,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1967983221, now seen corresponding path program 1 times [2025-03-09 01:55:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318108656] [2025-03-09 01:55:27,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:27,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:55:27,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:55:27,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:27,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:55:27,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:27,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318108656] [2025-03-09 01:55:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318108656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:55:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372584550] [2025-03-09 01:55:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:27,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:27,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:55:27,687 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-03-09 01:55:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:27,722 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 01:55:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:27,723 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-03-09 01:55:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:27,723 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:55:27,723 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:55:27,724 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-03-09 01:55:27,724 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-03-09 01:55:27,724 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-03-09 01:55:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:55:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-03-09 01:55:27,727 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-03-09 01:55:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-09 01:55:27,728 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2025-03-09 01:55:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:27,728 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-09 01:55:27,728 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-03-09 01:55:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-09 01:55:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:55:27,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:27,728 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-03-09 01:55:27,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:55:27,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:27,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 655168146, now seen corresponding path program 1 times [2025-03-09 01:55:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215366662] [2025-03-09 01:55:27,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:27,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:55:27,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:55:27,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215366662] [2025-03-09 01:55:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215366662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809175320] [2025-03-09 01:55:27,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:27,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:27,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:27,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:27,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:55:27,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:55:27,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:55:27,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:27,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:55:27,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:27,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809175320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:27,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:55:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753320657] [2025-03-09 01:55:27,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:55:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:27,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:55:27,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:55:27,940 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-03-09 01:55:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:28,007 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-03-09 01:55:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:55:28,007 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-03-09 01:55:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:28,008 INFO L225 Difference]: With dead ends: 94 [2025-03-09 01:55:28,008 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 01:55:28,008 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-03-09 01:55:28,008 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-03-09 01:55:28,009 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-03-09 01:55:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 01:55:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2025-03-09 01:55:28,016 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-03-09 01:55:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-09 01:55:28,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 30 [2025-03-09 01:55:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:28,020 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-09 01:55:28,020 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-03-09 01:55:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-09 01:55:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:55:28,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:28,020 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-03-09 01:55:28,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:28,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:28,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 655145306, now seen corresponding path program 1 times [2025-03-09 01:55:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785113375] [2025-03-09 01:55:28,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:28,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:55:28,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:55:28,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:28,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:55:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785113375] [2025-03-09 01:55:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785113375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:28,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:55:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773358257] [2025-03-09 01:55:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:28,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:28,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:28,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:55:28,263 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-03-09 01:55:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:28,282 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-03-09 01:55:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:28,283 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-03-09 01:55:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:28,283 INFO L225 Difference]: With dead ends: 75 [2025-03-09 01:55:28,283 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 01:55:28,284 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-03-09 01:55:28,284 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-03-09 01:55:28,284 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-03-09 01:55:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 01:55:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-03-09 01:55:28,288 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-03-09 01:55:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-03-09 01:55:28,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 30 [2025-03-09 01:55:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:28,289 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-03-09 01:55:28,289 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-03-09 01:55:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-03-09 01:55:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 01:55:28,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:28,290 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-03-09 01:55:28,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:55:28,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:28,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1165332017, now seen corresponding path program 1 times [2025-03-09 01:55:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:28,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035069798] [2025-03-09 01:55:28,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:28,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:55:28,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:55:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:28,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:55:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035069798] [2025-03-09 01:55:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035069798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548517511] [2025-03-09 01:55:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:28,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:28,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:28,335 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-03-09 01:55:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:28,348 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-09 01:55:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:28,349 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-03-09 01:55:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:28,349 INFO L225 Difference]: With dead ends: 85 [2025-03-09 01:55:28,349 INFO L226 Difference]: Without dead ends: 84 [2025-03-09 01:55:28,350 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-03-09 01:55:28,350 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-03-09 01:55:28,351 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-03-09 01:55:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-09 01:55:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2025-03-09 01:55:28,358 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-03-09 01:55:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-03-09 01:55:28,358 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 31 [2025-03-09 01:55:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:28,358 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-03-09 01:55:28,358 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-03-09 01:55:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2025-03-09 01:55:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 01:55:28,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:28,359 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-03-09 01:55:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:55:28,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:28,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash 522895474, now seen corresponding path program 2 times [2025-03-09 01:55:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417436815] [2025-03-09 01:55:28,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:28,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 01:55:28,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:55:28,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 01:55:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417436815] [2025-03-09 01:55:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417436815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034292575] [2025-03-09 01:55:28,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:28,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:28,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:55:28,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 01:55:28,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:55:28,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:28,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:28,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:55:28,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:55:28,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:55:28,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034292575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:28,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:28,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2025-03-09 01:55:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513009230] [2025-03-09 01:55:28,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:28,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:55:28,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:28,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:55:28,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:55:28,765 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-03-09 01:55:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:29,084 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2025-03-09 01:55:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:55:29,085 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-03-09 01:55:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:29,085 INFO L225 Difference]: With dead ends: 215 [2025-03-09 01:55:29,085 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 01:55:29,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:55:29,086 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:29,087 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.1s Time] [2025-03-09 01:55:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 01:55:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2025-03-09 01:55:29,090 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-03-09 01:55:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-09 01:55:29,091 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 48 [2025-03-09 01:55:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-09 01:55:29,091 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-03-09 01:55:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-09 01:55:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:55:29,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:29,092 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-03-09 01:55:29,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:55:29,296 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1567522557, now seen corresponding path program 3 times [2025-03-09 01:55:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563662583] [2025-03-09 01:55:29,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:29,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes. [2025-03-09 01:55:29,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:55:29,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:55:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:55:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563662583] [2025-03-09 01:55:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563662583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417476215] [2025-03-09 01:55:29,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:29,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:29,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:55:29,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes. [2025-03-09 01:55:29,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:55:29,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:55:29,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:29,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:55:29,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:55:29,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:55:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417476215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:29,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-09 01:55:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023837024] [2025-03-09 01:55:29,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:55:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:29,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:55:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:55:29,917 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-03-09 01:55:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:30,343 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2025-03-09 01:55:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-09 01:55:30,344 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-03-09 01:55:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:30,344 INFO L225 Difference]: With dead ends: 218 [2025-03-09 01:55:30,344 INFO L226 Difference]: Without dead ends: 153 [2025-03-09 01:55:30,346 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-03-09 01:55:30,347 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-03-09 01:55:30,347 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-03-09 01:55:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-09 01:55:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-09 01:55:30,356 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-03-09 01:55:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2025-03-09 01:55:30,357 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 55 [2025-03-09 01:55:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:30,357 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2025-03-09 01:55:30,357 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-03-09 01:55:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2025-03-09 01:55:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 01:55:30,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:30,359 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-03-09 01:55:30,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:55:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:55:30,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:55:30,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1372321742, now seen corresponding path program 4 times [2025-03-09 01:55:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567225239] [2025-03-09 01:55:30,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:55:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:30,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-09 01:55:30,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 01:55:30,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:55:30,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 190 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:55:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567225239] [2025-03-09 01:55:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567225239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854840270] [2025-03-09 01:55:31,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:55:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:31,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:31,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:55:31,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-09 01:55:31,757 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 01:55:31,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:55:31,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:31,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:55:31,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-09 01:55:31,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-09 01:55:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854840270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:32,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5, 5] total 40 [2025-03-09 01:55:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635038376] [2025-03-09 01:55:32,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:32,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:55:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:32,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:55:32,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:55:32,300 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-03-09 01:55:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:32,965 INFO L93 Difference]: Finished difference Result 308 states and 342 transitions. [2025-03-09 01:55:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:55:32,965 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-03-09 01:55:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:32,966 INFO L225 Difference]: With dead ends: 308 [2025-03-09 01:55:32,966 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:55:32,967 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-03-09 01:55:32,967 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-03-09 01:55:32,968 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-03-09 01:55:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:55:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:55:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:55:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:55:32,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-03-09 01:55:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:32,969 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:55:32,969 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-03-09 01:55:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:55:32,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 01:55:32,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 01:55:32,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:33,174 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:33,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:55:34,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:55:34,403 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-09 01:55:34,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:55:34 BoogieIcfgContainer [2025-03-09 01:55:34,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:55:34,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:55:34,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:55:34,407 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:55:34,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:23" (3/4) ... [2025-03-09 01:55:34,410 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:55:34,414 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure insertionSort [2025-03-09 01:55:34,416 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 01:55:34,418 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:55:34,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:55:34,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:55:34,437 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-03-09 01:55:34,444 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-03-09 01:55:34,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:55:34,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:55:34,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:55:34,474 INFO L158 Benchmark]: Toolchain (without parser) took 11028.97ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 107.2MB in the beginning and 122.5MB in the end (delta: -15.3MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. [2025-03-09 01:55:34,474 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:55:34,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.90ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 96.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:55:34,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.71ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.7MB in the end (delta: 991.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:55:34,475 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 988.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:55:34,475 INFO L158 Benchmark]: IcfgBuilder took 263.53ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:55:34,476 INFO L158 Benchmark]: TraceAbstraction took 10506.70ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 80.9MB in the beginning and 130.6MB in the end (delta: -49.7MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2025-03-09 01:55:34,477 INFO L158 Benchmark]: Witness Printer took 66.39ms. Allocated memory is still 318.8MB. Free memory was 130.6MB in the beginning and 122.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:55:34,478 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.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.90ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 96.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.71ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.7MB in the end (delta: 991.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 988.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 263.53ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10506.70ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 80.9MB in the beginning and 130.6MB in the end (delta: -49.7MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. * Witness Printer took 66.39ms. Allocated memory is still 318.8MB. Free memory was 130.6MB in the beginning and 122.5MB in the end (delta: 8.1MB). 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, 47 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1330 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1330 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 0.7s 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.6s 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, 3.9s 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-03-09 01:55:34,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE