./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 20:26:10,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:26:10,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:26:10,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:26:10,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:26:10,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:26:10,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:26:10,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:26:10,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:26:10,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:26:10,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:26:10,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:26:10,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:26:10,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:26:10,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:26:10,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:26:10,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:26:10,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:26:10,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:26:10,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:26:10,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:26:10,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:26:10,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:26:10,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:26:10,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:26:10,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:26:10,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:26:10,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:26:10,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:26:10,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:26:10,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:26:10,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:26:10,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:26:10,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:26:10,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:26:10,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:26:10,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:26:10,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:26:10,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:26:10,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:26:10,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:26:10,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-11 20:26:11,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:26:11,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:26:11,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:26:11,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:26:11,205 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:26:11,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-11 20:26:12,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:26:12,966 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:26:12,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-11 20:26:12,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83ccb5907/9ee7b9c63d4c403cab611044877a6a78/FLAGe5b82980f [2024-10-11 20:26:12,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83ccb5907/9ee7b9c63d4c403cab611044877a6a78 [2024-10-11 20:26:12,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:26:12,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:26:12,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:26:12,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:26:13,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:26:13,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:12" (1/1) ... [2024-10-11 20:26:13,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5033b5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13, skipping insertion in model container [2024-10-11 20:26:13,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:12" (1/1) ... [2024-10-11 20:26:13,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:26:13,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:26:13,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:26:13,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:26:13,253 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:26:13,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13 WrapperNode [2024-10-11 20:26:13,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:26:13,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:26:13,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:26:13,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:26:13,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,281 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-11 20:26:13,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:26:13,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:26:13,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:26:13,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:26:13,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,309 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-11 20:26:13,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:26:13,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:26:13,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:26:13,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:26:13,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (1/1) ... [2024-10-11 20:26:13,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:26:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:13,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:26:13,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:26:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:26:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:26:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-10-11 20:26:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-10-11 20:26:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:26:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:26:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:26:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:26:13,493 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:26:13,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:26:13,735 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 20:26:13,735 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:26:13,774 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:26:13,775 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:26:13,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:13 BoogieIcfgContainer [2024-10-11 20:26:13,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:26:13,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:26:13,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:26:13,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:26:13,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:26:12" (1/3) ... [2024-10-11 20:26:13,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b186e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:13, skipping insertion in model container [2024-10-11 20:26:13,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:13" (2/3) ... [2024-10-11 20:26:13,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b186e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:13, skipping insertion in model container [2024-10-11 20:26:13,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:13" (3/3) ... [2024-10-11 20:26:13,787 INFO L112 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2024-10-11 20:26:13,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:26:13,805 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 20:26:13,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:26:13,886 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;@3a738242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:26:13,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 20:26:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 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) [2024-10-11 20:26:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:26:13,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:13,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:26:13,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 3480497, now seen corresponding path program 1 times [2024-10-11 20:26:13,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424980334] [2024-10-11 20:26:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424980334] [2024-10-11 20:26:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424980334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234843472] [2024-10-11 20:26:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:14,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:14,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:14,237 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:14,325 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-10-11 20:26:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:26:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:14,335 INFO L225 Difference]: With dead ends: 74 [2024-10-11 20:26:14,335 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:26:14,340 INFO L431 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 [2024-10-11 20:26:14,344 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:14,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:26:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 20:26:14,380 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) [2024-10-11 20:26:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-11 20:26:14,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 4 [2024-10-11 20:26:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:14,384 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-11 20:26:14,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-11 20:26:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:26:14,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:14,385 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 20:26:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:26:14,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 608368800, now seen corresponding path program 1 times [2024-10-11 20:26:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242679004] [2024-10-11 20:26:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242679004] [2024-10-11 20:26:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242679004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258677218] [2024-10-11 20:26:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:14,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:14,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:26:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:14,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:26:14,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:14,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:26:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258677218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:14,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:26:14,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:26:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648521593] [2024-10-11 20:26:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:14,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:26:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:26:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:14,714 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:14,764 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-11 20:26:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:14,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 7 [2024-10-11 20:26:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:14,766 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:26:14,767 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 20:26:14,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:14,768 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:14,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 20:26:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 20:26:14,774 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) [2024-10-11 20:26:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-11 20:26:14,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2024-10-11 20:26:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:14,776 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-11 20:26:14,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-11 20:26:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:26:14,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:14,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-10-11 20:26:14,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:26:14,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:14,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1679563714, now seen corresponding path program 1 times [2024-10-11 20:26:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680129921] [2024-10-11 20:26:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:15,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680129921] [2024-10-11 20:26:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680129921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214330526] [2024-10-11 20:26:15,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:15,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:15,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:15,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:26:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:15,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:26:15,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:15,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214330526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:15,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:26:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011532935] [2024-10-11 20:26:15,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:26:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:26:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:26:15,253 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:15,314 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-11 20:26:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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 [2024-10-11 20:26:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:15,316 INFO L225 Difference]: With dead ends: 44 [2024-10-11 20:26:15,316 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:26:15,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:26:15,318 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:15,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:26:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:26:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.5) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-11 20:26:15,326 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 8 [2024-10-11 20:26:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:15,326 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-11 20:26:15,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-11 20:26:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:26:15,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:15,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:15,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:26:15,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:15,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -981887996, now seen corresponding path program 1 times [2024-10-11 20:26:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274063557] [2024-10-11 20:26:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274063557] [2024-10-11 20:26:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274063557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229696139] [2024-10-11 20:26:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:15,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:26:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:26:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:26:15,603 INFO L87 Difference]: Start difference. First operand 43 states and 50 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) [2024-10-11 20:26:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:15,622 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-10-11 20:26:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:26:15,623 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 [2024-10-11 20:26:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:15,624 INFO L225 Difference]: With dead ends: 68 [2024-10-11 20:26:15,625 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:26:15,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:26:15,626 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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 [2024-10-11 20:26:15,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:26:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:26:15,635 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) [2024-10-11 20:26:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-11 20:26:15,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 10 [2024-10-11 20:26:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:15,637 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-11 20:26:15,637 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) [2024-10-11 20:26:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-11 20:26:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:26:15,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:15,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:15,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:26:15,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:15,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 698597811, now seen corresponding path program 1 times [2024-10-11 20:26:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885814774] [2024-10-11 20:26:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885814774] [2024-10-11 20:26:15,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885814774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:15,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:15,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:15,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531333375] [2024-10-11 20:26:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:15,747 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) [2024-10-11 20:26:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:15,844 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-11 20:26:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:15,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:26:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:15,849 INFO L225 Difference]: With dead ends: 78 [2024-10-11 20:26:15,849 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 20:26:15,850 INFO L431 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 [2024-10-11 20:26:15,850 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:15,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 20:26:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-10-11 20:26:15,856 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) [2024-10-11 20:26:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-10-11 20:26:15,858 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 13 [2024-10-11 20:26:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-10-11 20:26:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-10-11 20:26:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:26:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:15,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:26:15,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1478234453, now seen corresponding path program 1 times [2024-10-11 20:26:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845974759] [2024-10-11 20:26:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845974759] [2024-10-11 20:26:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845974759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885146970] [2024-10-11 20:26:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:15,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:26:15,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:26:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:26:15,912 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) [2024-10-11 20:26:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:15,932 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2024-10-11 20:26:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:26:15,935 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 [2024-10-11 20:26:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:15,936 INFO L225 Difference]: With dead ends: 104 [2024-10-11 20:26:15,936 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 20:26:15,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:26:15,937 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:15,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 20:26:15,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 20:26:15,952 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) [2024-10-11 20:26:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-10-11 20:26:15,953 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 16 [2024-10-11 20:26:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:15,954 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-10-11 20:26:15,954 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) [2024-10-11 20:26:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-10-11 20:26:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:26:15,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:15,956 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2024-10-11 20:26:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:26:15,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -955437167, now seen corresponding path program 2 times [2024-10-11 20:26:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752481136] [2024-10-11 20:26:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752481136] [2024-10-11 20:26:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752481136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236943966] [2024-10-11 20:26:16,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:26:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:16,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:16,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:16,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:26:16,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:26:16,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:26:16,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:26:16,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:26:16,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:26:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236943966] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:16,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 13 [2024-10-11 20:26:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005677866] [2024-10-11 20:26:16,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:16,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:26:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:26:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:26:16,356 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:16,524 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-10-11 20:26:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:26:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 20:26:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:16,525 INFO L225 Difference]: With dead ends: 69 [2024-10-11 20:26:16,525 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 20:26:16,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:26:16,526 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:16,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 20:26:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-10-11 20:26:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 51 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-10-11 20:26:16,533 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 17 [2024-10-11 20:26:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-10-11 20:26:16,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-10-11 20:26:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:26:16,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:16,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:16,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:26:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:16,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:16,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash -276505561, now seen corresponding path program 1 times [2024-10-11 20:26:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723635467] [2024-10-11 20:26:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:16,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723635467] [2024-10-11 20:26:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723635467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:26:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292225587] [2024-10-11 20:26:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:16,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:26:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:26:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:26:16,870 INFO L87 Difference]: Start difference. First operand 54 states and 67 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) [2024-10-11 20:26:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:16,957 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-11 20:26:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:26:16,958 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 [2024-10-11 20:26:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:16,958 INFO L225 Difference]: With dead ends: 83 [2024-10-11 20:26:16,962 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:26:16,962 INFO L431 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 [2024-10-11 20:26:16,963 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:16,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:26:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-10-11 20:26:16,969 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) [2024-10-11 20:26:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-11 20:26:16,970 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2024-10-11 20:26:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:16,970 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-11 20:26:16,970 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) [2024-10-11 20:26:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-11 20:26:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:26:16,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:16,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:16,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:26:16,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1299292871, now seen corresponding path program 1 times [2024-10-11 20:26:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686255564] [2024-10-11 20:26:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:26:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686255564] [2024-10-11 20:26:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686255564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116442493] [2024-10-11 20:26:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:17,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:17,041 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) [2024-10-11 20:26:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:17,070 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 20:26:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:17,070 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 [2024-10-11 20:26:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:17,071 INFO L225 Difference]: With dead ends: 41 [2024-10-11 20:26:17,072 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:26:17,072 INFO L431 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 [2024-10-11 20:26:17,073 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:17,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:26:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-11 20:26:17,078 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) [2024-10-11 20:26:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-10-11 20:26:17,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 22 [2024-10-11 20:26:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:17,081 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-10-11 20:26:17,081 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) [2024-10-11 20:26:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-10-11 20:26:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:26:17,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:17,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:17,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:26:17,082 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1623373381, now seen corresponding path program 1 times [2024-10-11 20:26:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658156515] [2024-10-11 20:26:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:17,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658156515] [2024-10-11 20:26:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658156515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070444469] [2024-10-11 20:26:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:17,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:26:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:17,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:26:17,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:17,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:26:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070444469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:26:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 20:26:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053251204] [2024-10-11 20:26:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:26:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:17,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:26:17,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:26:17,317 INFO L87 Difference]: Start difference. First operand 38 states and 41 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) [2024-10-11 20:26:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:17,385 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-11 20:26:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:17,386 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 23 [2024-10-11 20:26:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:17,386 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:26:17,386 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 20:26:17,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:26:17,387 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:17,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 49 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 20:26:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 20:26:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-11 20:26:17,395 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2024-10-11 20:26:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-11 20:26:17,396 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) [2024-10-11 20:26:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-11 20:26:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:26:17,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:17,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:17,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:26:17,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:26:17,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1214845557, now seen corresponding path program 1 times [2024-10-11 20:26:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748162314] [2024-10-11 20:26:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748162314] [2024-10-11 20:26:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748162314] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981970388] [2024-10-11 20:26:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:17,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:17,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:26:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:17,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:26:17,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:17,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:26:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981970388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:26:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-11 20:26:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435137634] [2024-10-11 20:26:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:17,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:26:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:26:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:26:17,813 INFO L87 Difference]: Start difference. First operand 36 states and 39 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) [2024-10-11 20:26:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:17,863 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-11 20:26:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:17,864 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 24 [2024-10-11 20:26:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:17,865 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:26:17,865 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:26:17,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:26:17,865 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 56 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 [2024-10-11 20:26:17,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 56 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:26:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 20:26:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-11 20:26:17,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2024-10-11 20:26:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-11 20:26:17,875 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) [2024-10-11 20:26:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-11 20:26:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:26:17,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:17,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:17,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:26:18,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:26:18,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 994493467, now seen corresponding path program 1 times [2024-10-11 20:26:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520917840] [2024-10-11 20:26:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:26:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520917840] [2024-10-11 20:26:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520917840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359328657] [2024-10-11 20:26:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:18,149 INFO L87 Difference]: Start difference. First operand 35 states and 38 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) [2024-10-11 20:26:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:18,203 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-11 20:26:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:18,203 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 25 [2024-10-11 20:26:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:18,204 INFO L225 Difference]: With dead ends: 48 [2024-10-11 20:26:18,204 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:26:18,204 INFO L431 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 [2024-10-11 20:26:18,205 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:18,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:26:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2024-10-11 20:26:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 34 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) [2024-10-11 20:26:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-11 20:26:18,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2024-10-11 20:26:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:18,211 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-11 20:26:18,211 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) [2024-10-11 20:26:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-11 20:26:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:26:18,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:18,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:26:18,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 945538711, now seen corresponding path program 1 times [2024-10-11 20:26:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510352435] [2024-10-11 20:26:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510352435] [2024-10-11 20:26:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510352435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946994909] [2024-10-11 20:26:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:18,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:18,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:18,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:26:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:18,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:26:18,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:18,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946994909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:18,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-11 20:26:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702400659] [2024-10-11 20:26:18,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:26:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:26:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:26:18,476 INFO L87 Difference]: Start difference. First operand 37 states and 41 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) [2024-10-11 20:26:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:18,573 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-11 20:26:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:18,573 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 27 [2024-10-11 20:26:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:18,574 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:26:18,574 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 20:26:18,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:26:18,575 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 86 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:18,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 20:26:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2024-10-11 20:26:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 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) [2024-10-11 20:26:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-10-11 20:26:18,583 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 27 [2024-10-11 20:26:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:18,583 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-10-11 20:26:18,583 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) [2024-10-11 20:26:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-10-11 20:26:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:26:18,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:18,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:18,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:26:18,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:26:18,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 945588115, now seen corresponding path program 1 times [2024-10-11 20:26:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038553592] [2024-10-11 20:26:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:26:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038553592] [2024-10-11 20:26:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038553592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:18,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:18,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529656601] [2024-10-11 20:26:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:18,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:18,837 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2024-10-11 20:26:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:18,862 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-11 20:26:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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 27 [2024-10-11 20:26:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:18,863 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:26:18,863 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:26:18,863 INFO L431 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 [2024-10-11 20:26:18,863 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:18,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:26:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-11 20:26:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 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) [2024-10-11 20:26:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-11 20:26:18,869 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 27 [2024-10-11 20:26:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:18,870 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-11 20:26:18,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2024-10-11 20:26:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-11 20:26:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:26:18,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:18,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:18,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:26:18,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:18,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -751539445, now seen corresponding path program 1 times [2024-10-11 20:26:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042377022] [2024-10-11 20:26:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:26:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042377022] [2024-10-11 20:26:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042377022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:18,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:18,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405744572] [2024-10-11 20:26:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:18,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:18,910 INFO L87 Difference]: Start difference. First operand 68 states and 78 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) [2024-10-11 20:26:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:18,936 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-11 20:26:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:18,936 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 28 [2024-10-11 20:26:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:18,937 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:26:18,937 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 20:26:18,937 INFO L431 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 [2024-10-11 20:26:18,938 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:18,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:26:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 20:26:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2024-10-11 20:26:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 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) [2024-10-11 20:26:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-10-11 20:26:18,944 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 28 [2024-10-11 20:26:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:18,944 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-10-11 20:26:18,944 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) [2024-10-11 20:26:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-10-11 20:26:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:26:18,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:18,945 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:26:18,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 53763351, now seen corresponding path program 2 times [2024-10-11 20:26:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855443186] [2024-10-11 20:26:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:26:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855443186] [2024-10-11 20:26:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855443186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546991170] [2024-10-11 20:26:19,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:26:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:19,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:19,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:26:19,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:26:19,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:26:19,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:26:19,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:26:19,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:26:19,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546991170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:19,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2024-10-11 20:26:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929330772] [2024-10-11 20:26:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:26:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:26:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:26:19,446 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:19,760 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2024-10-11 20:26:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 20:26:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 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 45 [2024-10-11 20:26:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:19,761 INFO L225 Difference]: With dead ends: 153 [2024-10-11 20:26:19,761 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:26:19,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:26:19,763 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 89 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:19,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 159 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:26:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:26:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-10-11 20:26:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 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) [2024-10-11 20:26:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-11 20:26:19,771 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 45 [2024-10-11 20:26:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:19,772 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-11 20:26:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-11 20:26:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 20:26:19,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:19,775 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:19,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:26:19,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:19,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:26:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 669016840, now seen corresponding path program 3 times [2024-10-11 20:26:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970164138] [2024-10-11 20:26:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:26:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970164138] [2024-10-11 20:26:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970164138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258648310] [2024-10-11 20:26:20,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:26:20,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:20,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:20,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:26:20,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 20:26:20,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:26:20,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:26:20,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:26:20,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:26:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258648310] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:20,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 20 [2024-10-11 20:26:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820537617] [2024-10-11 20:26:20,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:20,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 20:26:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 20:26:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:26:20,699 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:21,039 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-11 20:26:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:26:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 20:26:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:21,040 INFO L225 Difference]: With dead ends: 141 [2024-10-11 20:26:21,040 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:26:21,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 20:26:21,042 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:21,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 229 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:26:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:26:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:26:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:26:21,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-11 20:26:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:26:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:26:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:26:21,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:26:21,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 20:26:21,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 20:26:21,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 20:26:21,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 20:26:21,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 20:26:21,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 20:26:21,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 20:26:21,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 20:26:21,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 20:26:21,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 20:26:21,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:26:21,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:26:21,252 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:21,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:26:22,211 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:26:22,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:26:22 BoogieIcfgContainer [2024-10-11 20:26:22,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:26:22,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:26:22,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:26:22,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:26:22,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:13" (3/4) ... [2024-10-11 20:26:22,236 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:26:22,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure insertionSort [2024-10-11 20:26:22,243 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 20:26:22,243 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:26:22,243 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:26:22,243 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:26:22,268 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) [2024-10-11 20:26:22,282 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) [2024-10-11 20:26:22,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:26:22,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:26:22,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:26:22,336 INFO L158 Benchmark]: Toolchain (without parser) took 9341.36ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 110.8MB in the beginning and 120.3MB in the end (delta: -9.5MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-10-11 20:26:22,336 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:26:22,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.72ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 99.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:26:22,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.84ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:26:22,337 INFO L158 Benchmark]: Boogie Preprocessor took 40.67ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:26:22,337 INFO L158 Benchmark]: RCFGBuilder took 451.24ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 81.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:26:22,338 INFO L158 Benchmark]: TraceAbstraction took 8451.91ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 81.0MB in the beginning and 125.6MB in the end (delta: -44.6MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-10-11 20:26:22,338 INFO L158 Benchmark]: Witness Printer took 102.55ms. Allocated memory is still 228.6MB. Free memory was 124.5MB in the beginning and 120.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:26:22,339 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 167.8MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.72ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 99.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.84ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.67ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 451.24ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 81.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8451.91ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 81.0MB in the beginning and 125.6MB in the end (delta: -44.6MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Witness Printer took 102.55ms. Allocated memory is still 228.6MB. Free memory was 124.5MB in the beginning and 120.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 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: 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, 38 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 1706 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1315 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1145 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 391 mSDtfsCounter, 1145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 313 SyntacticMatches, 16 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=16, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 91 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 569 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 688 ConstructedInterpolants, 0 QuantifiedInterpolants, 1577 SizeOfPredicates, 17 NumberOfNonLiveVariables, 825 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 369/527 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((n <= 2147483647) && (1 <= i)) || (((n <= 2147483647) && (i == 0)) && (1 <= n))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) - ProcedureContractResult [Line: 8]: Procedure Contract for insertionSort Derived contract for procedure insertionSort. Requires: ((((i <= 2147483647) && (1 <= i)) && (size <= 2147483647)) || ((i == 0) && (size <= 2147483647))) Ensures: ((((i <= 2147483647) && (1 <= i)) && (size <= 2147483647)) || ((i == 0) && (size <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:26:22,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE