/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:17:20,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:17:20,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:17:21,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:17:21,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:17:21,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:17:21,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:17:21,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:17:21,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:17:21,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:17:21,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:17:21,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:17:21,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:17:21,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:17:21,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:17:21,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:17:21,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:17:21,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:17:21,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:17:21,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:17:21,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:17:21,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:17:21,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:17:21,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:17:21,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:17:21,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:17:21,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:17:21,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:17:21,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:17:21,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:17:21,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:17:21,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:17:21,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:17:21,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:17:21,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:17:21,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:17:21,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:17:21,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:17:21,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:17:21,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:17:21,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:17:21,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 22:17:21,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:17:21,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:17:21,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:17:21,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:17:21,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:17:21,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:17:21,116 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:17:21,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:17:21,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:17:21,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:17:21,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:17:21,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:17:21,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:17:21,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:17:21,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:17:21,121 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:17:21,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:17:21,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:17:21,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:17:21,351 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:17:21,352 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:17:21,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl [2022-03-15 22:17:21,354 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl' [2022-03-15 22:17:21,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:17:21,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:17:21,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:17:21,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:17:21,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:17:21,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,398 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:17:21,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:17:21,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:17:21,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:17:21,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:17:21,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:17:21,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:17:21,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:17:21,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:17:21,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/1) ... [2022-03-15 22:17:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:17:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:21,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:17:21,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:17:21,500 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:17:21,500 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:17:21,500 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:17:21,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:17:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:17:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:17:21,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:17:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:17:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:17:21,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:17:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:17:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:17:21,502 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:17:21,545 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:17:21,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:17:21,650 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:17:21,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:17:21,663 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:17:21,664 INFO L202 PluginConnector]: Adding new model sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:17:21 BoogieIcfgContainer [2022-03-15 22:17:21,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:17:21,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:17:21,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:17:21,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:17:21,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:21" (1/2) ... [2022-03-15 22:17:21,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ecfa52 and model type sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:17:21, skipping insertion in model container [2022-03-15 22:17:21,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:17:21" (2/2) ... [2022-03-15 22:17:21,671 INFO L111 eAbstractionObserver]: Analyzing ICFG sum-array.wvr.bpl [2022-03-15 22:17:21,683 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:17:21,683 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:17:21,684 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:17:21,684 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:17:21,725 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:17:21,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:17:21,804 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 22:17:21,805 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:17:21,816 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:17:21,824 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:21,826 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:21,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:21,846 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:17:21,846 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:17:21,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:17:21,850 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:17:22,088 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:17:22,089 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:17:22,097 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:17:22,108 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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) [2022-03-15 22:17:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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) [2022-03-15 22:17:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:17:22,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:22,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:22,115 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:17:22,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:22,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184492392] [2022-03-15 22:17:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:22,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:22,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184492392] [2022-03-15 22:17:22,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184492392] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:22,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:22,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:17:22,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [977547341] [2022-03-15 22:17:22,253 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:22,256 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:22,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:17:22,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:22,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:22,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:17:22,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:17:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:22,648 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-03-15 22:17:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:22,685 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:17:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:17:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-03-15 22:17:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:22,695 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:17:22,695 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:17:22,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:22,705 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 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 [2022-03-15 22:17:22,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:17:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:17:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:17:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 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) [2022-03-15 22:17:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:17:22,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:17:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:22,741 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:17:22,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-03-15 22:17:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:17:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:17:22,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:22,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:22,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:17:22,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:17:22,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:22,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808525405] [2022-03-15 22:17:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:22,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:22,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808525405] [2022-03-15 22:17:22,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808525405] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:22,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:22,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:17:22,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689179653] [2022-03-15 22:17:22,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:22,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:22,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:17:22,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:22,990 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:22,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:17:22,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:17:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:22,993 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2022-03-15 22:17:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:23,020 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:17:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:17:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 12 [2022-03-15 22:17:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:23,022 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:17:23,022 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:17:23,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:23,023 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:23,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:17:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:17:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:17:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 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) [2022-03-15 22:17:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:17:23,029 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:17:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:23,029 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:17:23,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2022-03-15 22:17:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:17:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:17:23,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:23,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:23,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:17:23,031 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:17:23,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:23,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594133525] [2022-03-15 22:17:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:23,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:23,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594133525] [2022-03-15 22:17:23,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594133525] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:23,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:23,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:17:23,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894251949] [2022-03-15 22:17:23,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:23,079 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:23,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:17:23,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:23,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:23,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:17:23,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:17:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:17:23,219 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:23,257 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:17:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:17:23,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:17:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:23,258 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:17:23,258 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:17:23,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:17:23,260 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:23,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:17:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:17:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:17:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 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) [2022-03-15 22:17:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:17:23,266 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:17:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:23,266 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:17:23,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:17:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:17:23,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:23,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:23,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:17:23,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:17:23,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:23,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538295288] [2022-03-15 22:17:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:23,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:23,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538295288] [2022-03-15 22:17:23,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538295288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:23,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086354529] [2022-03-15 22:17:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:23,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:23,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:23,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:23,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 22:17:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:23,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:17:23,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:23,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:17:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:23,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:23,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:23,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 16 [2022-03-15 22:17:23,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2022-03-15 22:17:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:23,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086354529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:23,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:23,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 22:17:23,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314365417] [2022-03-15 22:17:23,878 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:23,879 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:23,883 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:17:23,883 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:24,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (< sum2 (+ (select A i) sum1 1)) (<= (+ (select A i) sum1) sum2)), 545#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 544#(and (or (< sum2 (+ (select A i) sum1 1)) (< j M)) (or (< j M) (<= (+ (select A i) sum1) sum2))), 541#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 542#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))))] [2022-03-15 22:17:24,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:24,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:17:24,649 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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) [2022-03-15 22:17:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:24,874 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:17:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:17:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 13 [2022-03-15 22:17:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:24,875 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:17:24,876 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:17:24,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:17:24,877 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:24,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:17:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:17:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 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) [2022-03-15 22:17:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:17:24,886 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:17:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:24,886 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:17:24,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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) [2022-03-15 22:17:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:17:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:24,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:24,888 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:24,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:25,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:25,096 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:17:25,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:25,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456219016] [2022-03-15 22:17:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:25,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:25,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456219016] [2022-03-15 22:17:25,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456219016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:25,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346581658] [2022-03-15 22:17:25,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:25,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:25,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:25,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:17:25,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:25,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:25,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:17:25,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:25,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:25,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346581658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:25,315 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:25,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:17:25,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290225124] [2022-03-15 22:17:25,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:25,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:25,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:17:25,323 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:25,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (< j M) (< i N)), 838#(or (<= k i) (< j M)), 845#(< i N), 852#(or (< k N) (< i N)), 860#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 850#(or (<= (+ 2 k) N) (< j M)), 847#(or (<= N (+ i 1)) (< (+ 2 i) N)), 853#(or (< j M) (< k N) (< i N)), 849#(or (<= (+ k 1) N) (< j M)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 848#(< j M), 846#(or (<= N i) (< (+ i 1) N)), 856#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 854#(or (<= N i) (< (+ i 1) N) (< k N)), 857#(or (< j M) (<= (+ k 1) i)), 858#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:17:25,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:17:25,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:17:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:17:25,983 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 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) [2022-03-15 22:17:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:27,024 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:17:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:17:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 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 14 [2022-03-15 22:17:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:27,026 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:17:27,026 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:17:27,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:17:27,029 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:27,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:17:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:17:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:17:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 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) [2022-03-15 22:17:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:17:27,040 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:17:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:27,041 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:17:27,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 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) [2022-03-15 22:17:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:17:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:27,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:27,042 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:27,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:27,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:27,252 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:17:27,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:27,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067721241] [2022-03-15 22:17:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:27,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:27,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067721241] [2022-03-15 22:17:27,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067721241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:27,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814730600] [2022-03-15 22:17:27,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:27,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:27,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:27,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:17:27,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:17:27,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:27,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:17:27,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:27,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:27,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814730600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:27,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:27,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:17:27,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991317357] [2022-03-15 22:17:27,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:27,456 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:27,461 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:17:27,461 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:27,738 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1386#(or (<= N i) (< (+ i 1) N) (<= N k)), 1384#(or (<= N i) (< (+ i 1) N)), 1383#(< i N), 1385#(or (<= N k) (< i N))] [2022-03-15 22:17:27,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:27,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:17:27,739 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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) [2022-03-15 22:17:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:28,098 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:17:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:17:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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 14 [2022-03-15 22:17:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:28,100 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:17:28,100 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:17:28,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:17:28,102 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:28,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:17:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:17:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 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) [2022-03-15 22:17:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:17:28,114 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:17:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:28,114 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:17:28,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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) [2022-03-15 22:17:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:17:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:28,116 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:28,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:28,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:28,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:28,341 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:17:28,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:28,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231035321] [2022-03-15 22:17:28,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:28,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:28,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231035321] [2022-03-15 22:17:28,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231035321] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:28,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084355446] [2022-03-15 22:17:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:28,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:28,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:28,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:17:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:28,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:17:28,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:28,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:28,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084355446] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:28,535 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:28,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:17:28,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541522128] [2022-03-15 22:17:28,535 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:28,537 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:28,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:17:28,541 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:28,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2025#(or (< (+ j 1) M) (<= M j)), 2026#(or (< j M) (< i N)), 2024#(< j M), 2029#(or (< (+ j 1) M) (< i N) (<= M j)), 2027#(or (<= N i) (<= (+ 2 i) N)), 2028#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:17:28,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:28,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:17:28,868 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-03-15 22:17:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:29,067 INFO L93 Difference]: Finished difference Result 204 states and 669 transitions. [2022-03-15 22:17:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:17:29,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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 14 [2022-03-15 22:17:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:29,069 INFO L225 Difference]: With dead ends: 204 [2022-03-15 22:17:29,069 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 22:17:29,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:17:29,070 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:29,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 22:17:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2022-03-15 22:17:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.312883435582822) internal successors, (540), 163 states have internal predecessors, (540), 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) [2022-03-15 22:17:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 540 transitions. [2022-03-15 22:17:29,086 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 540 transitions. Word has length 14 [2022-03-15 22:17:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:29,086 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 540 transitions. [2022-03-15 22:17:29,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-03-15 22:17:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 540 transitions. [2022-03-15 22:17:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:29,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:29,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:29,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:29,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:29,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1863769352, now seen corresponding path program 2 times [2022-03-15 22:17:29,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:29,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665116067] [2022-03-15 22:17:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:29,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:29,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665116067] [2022-03-15 22:17:29,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665116067] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:29,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452546284] [2022-03-15 22:17:29,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:29,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:29,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:29,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:17:29,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:29,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:29,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:17:29,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:29,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:29,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452546284] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:29,499 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:29,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 22:17:29,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747628252] [2022-03-15 22:17:29,499 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:29,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:29,505 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:17:29,505 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:29,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2660#(< j M), 2662#(or (< (+ j 1) M) (<= M j)), 2661#(or (< j M) (< i N)), 2663#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:17:29,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:17:29,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:17:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:17:29,788 INFO L87 Difference]: Start difference. First operand 164 states and 540 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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) [2022-03-15 22:17:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:29,968 INFO L93 Difference]: Finished difference Result 229 states and 744 transitions. [2022-03-15 22:17:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:17:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 14 [2022-03-15 22:17:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:29,970 INFO L225 Difference]: With dead ends: 229 [2022-03-15 22:17:29,970 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:17:29,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:17:29,971 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:29,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:17:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2022-03-15 22:17:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 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) [2022-03-15 22:17:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:17:29,979 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:17:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:29,979 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:17:29,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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) [2022-03-15 22:17:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:17:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:29,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:29,980 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:30,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:30,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:30,204 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:17:30,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:30,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815424577] [2022-03-15 22:17:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:30,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815424577] [2022-03-15 22:17:30,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815424577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:30,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670337971] [2022-03-15 22:17:30,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:30,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:30,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:30,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:30,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:17:30,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:30,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:30,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:17:30,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:30,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-03-15 22:17:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:30,722 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:30,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 46 [2022-03-15 22:17:30,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:30,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:30,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:30,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 5 [2022-03-15 22:17:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670337971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:30,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:30,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-03-15 22:17:30,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974264000] [2022-03-15 22:17:30,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:30,874 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:30,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:17:30,879 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:33,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [3357#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))) (or (< j M) (<= (+ k 1) i))), 3364#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 3341#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 3342#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 3360#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 3346#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 3359#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 3363#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 3356#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 3361#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 3358#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 3344#(and (or (< j M) (<= sum1 (+ (select A k) (select A (+ (- 1) N)))) (< (+ 2 k) N)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) (select A (+ (- 1) N))) sum1)) (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 3355#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 3349#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 3348#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 3343#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 3351#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 3354#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 3350#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 3345#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 3347#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 3352#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 3362#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 3353#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N)))] [2022-03-15 22:17:33,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:17:33,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:33,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:17:33,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:17:33,400 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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) [2022-03-15 22:17:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:39,037 INFO L93 Difference]: Finished difference Result 461 states and 1398 transitions. [2022-03-15 22:17:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 22:17:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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 15 [2022-03-15 22:17:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:39,042 INFO L225 Difference]: With dead ends: 461 [2022-03-15 22:17:39,042 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 22:17:39,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1969, Invalid=10463, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 22:17:39,045 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:39,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:17:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 22:17:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 218. [2022-03-15 22:17:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.414746543778802) internal successors, (741), 217 states have internal predecessors, (741), 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) [2022-03-15 22:17:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 741 transitions. [2022-03-15 22:17:39,054 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 741 transitions. Word has length 15 [2022-03-15 22:17:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:39,054 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 741 transitions. [2022-03-15 22:17:39,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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) [2022-03-15 22:17:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 741 transitions. [2022-03-15 22:17:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:39,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:39,055 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:39,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:17:39,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:39,260 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:17:39,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:39,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821046775] [2022-03-15 22:17:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:39,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:39,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821046775] [2022-03-15 22:17:39,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821046775] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:39,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418620074] [2022-03-15 22:17:39,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:39,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:39,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:39,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:17:39,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:17:39,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:39,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:17:39,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:39,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:39,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418620074] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:39,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:39,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 22:17:39,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241910680] [2022-03-15 22:17:39,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:39,474 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:39,478 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:17:39,478 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:40,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4502#(or (< j M) (< k N)), 4508#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4506#(or (< j M) (<= N k) (< (+ k 1) N)), 4492#(or (< j M) (<= k (+ i 1))), 4500#(or (<= N k) (< (+ k 1) N)), 4509#(or (<= N i) (< k N)), 4505#(or (< j M) (<= (+ N 1) i) (< k N)), 4510#(or (<= N i) (<= N k) (< (+ k 1) N)), 4504#(or (< j M) (<= (+ N 1) i)), 4507#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4511#(or (<= N i) (< j M)), 4515#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 4501#(< j M), 4499#(< k N), 4512#(or (<= N i) (< j M) (< k N)), 4514#(or (<= N (+ i 1)) (< j M)), 4513#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 4503#(or (<= (+ N 1) i) (< k N))] [2022-03-15 22:17:40,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:17:40,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:17:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:17:40,172 INFO L87 Difference]: Start difference. First operand 218 states and 741 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 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) [2022-03-15 22:17:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:40,927 INFO L93 Difference]: Finished difference Result 307 states and 974 transitions. [2022-03-15 22:17:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:17:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 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 15 [2022-03-15 22:17:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:40,929 INFO L225 Difference]: With dead ends: 307 [2022-03-15 22:17:40,929 INFO L226 Difference]: Without dead ends: 304 [2022-03-15 22:17:40,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=2608, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:17:40,931 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:40,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:17:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-15 22:17:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 215. [2022-03-15 22:17:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.411214953271028) internal successors, (730), 214 states have internal predecessors, (730), 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) [2022-03-15 22:17:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 730 transitions. [2022-03-15 22:17:40,938 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 730 transitions. Word has length 15 [2022-03-15 22:17:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:40,938 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 730 transitions. [2022-03-15 22:17:40,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 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) [2022-03-15 22:17:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 730 transitions. [2022-03-15 22:17:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:40,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:40,939 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:40,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:41,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:41,156 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 833199328, now seen corresponding path program 3 times [2022-03-15 22:17:41,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:41,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287996631] [2022-03-15 22:17:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:41,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:41,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287996631] [2022-03-15 22:17:41,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287996631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:41,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613807362] [2022-03-15 22:17:41,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:41,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:41,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:17:41,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:17:41,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:41,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:17:41,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:41,584 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:41,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 40 [2022-03-15 22:17:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:42,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:42,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:42,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 68 [2022-03-15 22:17:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:43,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613807362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:43,010 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:43,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:17:43,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225923135] [2022-03-15 22:17:43,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:43,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:43,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:17:43,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:44,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [5412#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 5418#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 5415#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1))), 5422#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 5423#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 5429#(and (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (<= k i) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (<= k i) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (<= (+ k j) (+ M i 1)) (<= k i) (not (< i N)) (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0))), 5428#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 5419#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 5420#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 5425#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 5417#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 5416#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 5424#(and (or (<= k i) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (<= k i) (not (< i N)) (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (or (<= k i) (not (< i N)) (<= (+ (select A i) sum1) sum2))), 5421#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 5413#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 5427#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 5414#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 5426#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:17:44,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:17:44,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:17:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:17:44,968 INFO L87 Difference]: Start difference. First operand 215 states and 730 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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) [2022-03-15 22:17:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:50,416 INFO L93 Difference]: Finished difference Result 659 states and 1787 transitions. [2022-03-15 22:17:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 22:17:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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 15 [2022-03-15 22:17:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:50,420 INFO L225 Difference]: With dead ends: 659 [2022-03-15 22:17:50,420 INFO L226 Difference]: Without dead ends: 635 [2022-03-15 22:17:50,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3421 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1633, Invalid=9709, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:17:50,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:50,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:17:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-15 22:17:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 216. [2022-03-15 22:17:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.4232558139534883) internal successors, (736), 215 states have internal predecessors, (736), 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) [2022-03-15 22:17:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 736 transitions. [2022-03-15 22:17:50,433 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 736 transitions. Word has length 15 [2022-03-15 22:17:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:50,433 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 736 transitions. [2022-03-15 22:17:50,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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) [2022-03-15 22:17:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 736 transitions. [2022-03-15 22:17:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:50,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:50,434 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:50,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 22:17:50,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 22:17:50,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 4 times [2022-03-15 22:17:50,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:50,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464094538] [2022-03-15 22:17:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:50,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:50,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464094538] [2022-03-15 22:17:50,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464094538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:50,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698202503] [2022-03-15 22:17:50,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:50,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:50,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:17:50,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:50,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:50,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:17:50,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:50,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:50,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698202503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:50,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:50,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 11 [2022-03-15 22:17:50,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353244720] [2022-03-15 22:17:50,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:50,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:50,834 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:17:50,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:51,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6732#(< i N), 6761#(or (<= N i) (< (+ i 1) N) (< j M)), 6757#(or (<= N i) (< (+ i 1) N)), 6759#(< j M), 6758#(or (<= (+ 3 i) N) (<= N i)), 6763#(or (< (+ j 1) M) (<= M j)), 6760#(or (< j M) (< i N)), 6762#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6764#(or (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 22:17:51,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:17:51,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:17:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:17:51,168 INFO L87 Difference]: Start difference. First operand 216 states and 736 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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) [2022-03-15 22:17:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:51,607 INFO L93 Difference]: Finished difference Result 520 states and 1668 transitions. [2022-03-15 22:17:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:17:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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 15 [2022-03-15 22:17:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:51,610 INFO L225 Difference]: With dead ends: 520 [2022-03-15 22:17:51,611 INFO L226 Difference]: Without dead ends: 520 [2022-03-15 22:17:51,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:17:51,612 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:51,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-15 22:17:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 313. [2022-03-15 22:17:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 3.503205128205128) internal successors, (1093), 312 states have internal predecessors, (1093), 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) [2022-03-15 22:17:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 1093 transitions. [2022-03-15 22:17:51,626 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 1093 transitions. Word has length 15 [2022-03-15 22:17:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:51,626 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 1093 transitions. [2022-03-15 22:17:51,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 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) [2022-03-15 22:17:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 1093 transitions. [2022-03-15 22:17:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:51,627 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:51,627 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:51,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 22:17:51,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:51,843 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 5 times [2022-03-15 22:17:51,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:51,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949978255] [2022-03-15 22:17:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:51,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:51,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949978255] [2022-03-15 22:17:51,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949978255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:51,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766683908] [2022-03-15 22:17:51,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:51,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:51,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:17:52,012 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:52,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:52,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:17:52,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:52,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:52,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:52,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 22:17:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:52,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:52,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:52,374 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:52,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 19 treesize of output 54 [2022-03-15 22:17:52,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:52,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:52,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:52,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 47 [2022-03-15 22:17:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:52,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766683908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:52,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:52,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:17:52,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1226305030] [2022-03-15 22:17:52,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:52,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:52,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:17:52,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:53,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [8058#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 8055#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 8061#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 8057#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 8052#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 8063#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (< k N))), 8060#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)))))), 8053#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 8054#(and (or (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< i N))), 8064#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 8062#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 8056#(and (or (< k N) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< k N) (< i N))), 8059#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N)))] [2022-03-15 22:17:53,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:17:53,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:17:53,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:17:53,980 INFO L87 Difference]: Start difference. First operand 313 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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) [2022-03-15 22:17:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:56,293 INFO L93 Difference]: Finished difference Result 596 states and 1870 transitions. [2022-03-15 22:17:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:17:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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 15 [2022-03-15 22:17:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:56,296 INFO L225 Difference]: With dead ends: 596 [2022-03-15 22:17:56,296 INFO L226 Difference]: Without dead ends: 584 [2022-03-15 22:17:56,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=641, Invalid=3781, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:17:56,298 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 341 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:56,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 0 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-15 22:17:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 318. [2022-03-15 22:17:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 3.5078864353312302) internal successors, (1112), 317 states have internal predecessors, (1112), 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) [2022-03-15 22:17:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1112 transitions. [2022-03-15 22:17:56,315 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1112 transitions. Word has length 15 [2022-03-15 22:17:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:56,315 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 1112 transitions. [2022-03-15 22:17:56,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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) [2022-03-15 22:17:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1112 transitions. [2022-03-15 22:17:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:17:56,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:56,317 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:56,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:56,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:17:56,523 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:17:56,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:56,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709290950] [2022-03-15 22:17:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:56,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:56,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709290950] [2022-03-15 22:17:56,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709290950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:56,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994770672] [2022-03-15 22:17:56,586 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:17:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:56,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:56,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:17:56,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:17:56,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:56,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:17:56,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:56,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:56,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994770672] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:56,723 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:56,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:17:56,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840452181] [2022-03-15 22:17:56,725 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:56,726 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:56,731 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:17:56,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:57,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9477#(or (< j M) (< k N) (< i N)), 9478#(or (<= (+ 2 k) N) (< j M)), 9496#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9469#(or (<= N i) (< (+ i 1) N)), 9470#(< j M), 9494#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9495#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9468#(< i N), 9497#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9475#(or (< k N) (< i N)), 9488#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9492#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9476#(or (<= (+ k 1) N) (< j M)), 9486#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9487#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9461#(or (<= k i) (< j M)), 9482#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9472#(or (<= N i) (< (+ i 1) N) (< j M)), 9491#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 9471#(or (< j M) (< i N)), 9489#(or (<= (+ 2 k) i) (< j M)), 9483#(or (<= N i) (< (+ i 1) N) (< k N)), 9473#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9481#(or (<= (+ 3 k) N) (< j M)), 9480#(or (<= (+ 2 k) N) (< j M) (< i N)), 9485#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9490#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9484#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9474#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9479#(or (<= (+ 2 k) N) (< i N)), 9493#(or (< j M) (<= (+ k 1) i))] [2022-03-15 22:17:57,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:17:57,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:17:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:17:57,736 INFO L87 Difference]: Start difference. First operand 318 states and 1112 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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) [2022-03-15 22:17:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:59,687 INFO L93 Difference]: Finished difference Result 617 states and 2031 transitions. [2022-03-15 22:17:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:17:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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 16 [2022-03-15 22:17:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:59,690 INFO L225 Difference]: With dead ends: 617 [2022-03-15 22:17:59,690 INFO L226 Difference]: Without dead ends: 617 [2022-03-15 22:17:59,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:17:59,694 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:59,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-03-15 22:17:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 384. [2022-03-15 22:17:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.587467362924282) internal successors, (1374), 383 states have internal predecessors, (1374), 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) [2022-03-15 22:17:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1374 transitions. [2022-03-15 22:17:59,707 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1374 transitions. Word has length 16 [2022-03-15 22:17:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:59,707 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1374 transitions. [2022-03-15 22:17:59,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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) [2022-03-15 22:17:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1374 transitions. [2022-03-15 22:17:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:17:59,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:59,709 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:59,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:59,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:17:59,925 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:17:59,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:59,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556607742] [2022-03-15 22:17:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:59,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:59,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556607742] [2022-03-15 22:17:59,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556607742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:59,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979054444] [2022-03-15 22:17:59,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:17:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:59,978 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:00,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:18:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:00,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:00,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:00,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:00,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979054444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:00,135 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:00,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:18:00,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958965663] [2022-03-15 22:18:00,136 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:00,136 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:00,142 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:18:00,142 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:00,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11131#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11133#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11130#(or (<= N (+ k 1)) (< i N)), 11134#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11126#(< i N), 11132#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11129#(or (<= N i) (< (+ i 1) N) (<= N k)), 11128#(or (<= N k) (< i N)), 11127#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:18:00,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:00,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:00,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:18:00,622 INFO L87 Difference]: Start difference. First operand 384 states and 1374 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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) [2022-03-15 22:18:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:01,358 INFO L93 Difference]: Finished difference Result 1085 states and 3837 transitions. [2022-03-15 22:18:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:18:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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 16 [2022-03-15 22:18:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:01,364 INFO L225 Difference]: With dead ends: 1085 [2022-03-15 22:18:01,364 INFO L226 Difference]: Without dead ends: 1063 [2022-03-15 22:18:01,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:18:01,366 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:01,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:18:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-03-15 22:18:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 504. [2022-03-15 22:18:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.63220675944334) internal successors, (1827), 503 states have internal predecessors, (1827), 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) [2022-03-15 22:18:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1827 transitions. [2022-03-15 22:18:01,388 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1827 transitions. Word has length 16 [2022-03-15 22:18:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:01,388 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1827 transitions. [2022-03-15 22:18:01,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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) [2022-03-15 22:18:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1827 transitions. [2022-03-15 22:18:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:01,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:01,390 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:01,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:01,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:18:01,613 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 6 times [2022-03-15 22:18:01,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:01,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021929304] [2022-03-15 22:18:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:01,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:01,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021929304] [2022-03-15 22:18:01,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021929304] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:01,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077009780] [2022-03-15 22:18:01,662 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:01,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:01,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:01,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:01,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 22:18:01,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:18:01,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:01,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:01,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:01,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077009780] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:01,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:01,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:18:01,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784286856] [2022-03-15 22:18:01,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:01,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:01,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:18:01,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:02,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13417#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13407#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13405#(or (<= N i) (< (+ i 1) N) (<= N k)), 13408#(< j M), 13409#(or (< j M) (<= N k)), 13403#(or (<= N i) (< (+ i 1) N)), 13402#(< i N), 13410#(or (<= N (+ k 1)) (< j M)), 13412#(or (<= N i) (< (+ i 1) N) (< j M)), 13414#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13419#(or (< (+ j 1) M) (<= i k) (<= M j)), 13418#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13420#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13416#(or (< j M) (<= i k)), 13411#(or (< j M) (< i N)), 13406#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13413#(or (< j M) (<= N k) (< i N)), 13421#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13404#(or (<= N k) (< i N)), 13415#(or (< j M) (<= i (+ k 1)))] [2022-03-15 22:18:02,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:18:02,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:18:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:18:02,516 INFO L87 Difference]: Start difference. First operand 504 states and 1827 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 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) [2022-03-15 22:18:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:04,443 INFO L93 Difference]: Finished difference Result 1352 states and 4675 transitions. [2022-03-15 22:18:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:18:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 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 16 [2022-03-15 22:18:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:04,449 INFO L225 Difference]: With dead ends: 1352 [2022-03-15 22:18:04,449 INFO L226 Difference]: Without dead ends: 1338 [2022-03-15 22:18:04,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2305, Invalid=8825, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 22:18:04,451 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:04,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:18:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-03-15 22:18:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 682. [2022-03-15 22:18:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 3.922173274596182) internal successors, (2671), 681 states have internal predecessors, (2671), 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) [2022-03-15 22:18:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2671 transitions. [2022-03-15 22:18:04,479 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2671 transitions. Word has length 16 [2022-03-15 22:18:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:04,479 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 2671 transitions. [2022-03-15 22:18:04,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 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) [2022-03-15 22:18:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2671 transitions. [2022-03-15 22:18:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:04,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:04,482 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:04,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:04,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 22:18:04,695 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 7 times [2022-03-15 22:18:04,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:04,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612227809] [2022-03-15 22:18:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:04,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:04,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612227809] [2022-03-15 22:18:04,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612227809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:04,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978650682] [2022-03-15 22:18:04,753 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:04,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:04,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:04,754 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:04,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:18:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:04,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:04,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:04,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:04,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978650682] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:04,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:04,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:18:04,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810069636] [2022-03-15 22:18:04,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:04,892 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:04,896 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:18:04,896 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:05,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16405#(or (< j M) (<= (+ k 1) i)), 16399#(or (< k N) (< i N)), 16410#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16400#(or (< j M) (< k N) (< i N)), 16411#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16395#(or (<= (+ k 1) N) (< j M)), 16406#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16408#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16414#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16397#(< i N), 16404#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16403#(or (<= N i) (< (+ i 1) N) (< j M)), 16415#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16413#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16407#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16396#(or (<= (+ 2 k) N) (< j M)), 16402#(or (<= N i) (< (+ i 1) N) (< k N)), 16416#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16417#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16394#(< j M), 16412#(or (<= N i) (<= k (+ i 1))), 16398#(or (< j M) (< i N)), 16401#(or (<= N i) (< (+ i 1) N)), 16409#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:18:05,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:18:05,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:18:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:18:05,738 INFO L87 Difference]: Start difference. First operand 682 states and 2671 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 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) [2022-03-15 22:18:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:10,104 INFO L93 Difference]: Finished difference Result 2095 states and 6909 transitions. [2022-03-15 22:18:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:18:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 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 16 [2022-03-15 22:18:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:10,113 INFO L225 Difference]: With dead ends: 2095 [2022-03-15 22:18:10,113 INFO L226 Difference]: Without dead ends: 2095 [2022-03-15 22:18:10,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11810 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:18:10,116 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 638 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:10,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 0 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:18:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-03-15 22:18:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 946. [2022-03-15 22:18:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.061375661375662) internal successors, (3838), 945 states have internal predecessors, (3838), 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) [2022-03-15 22:18:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3838 transitions. [2022-03-15 22:18:10,155 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 3838 transitions. Word has length 16 [2022-03-15 22:18:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:10,155 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 3838 transitions. [2022-03-15 22:18:10,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 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) [2022-03-15 22:18:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 3838 transitions. [2022-03-15 22:18:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:10,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:10,158 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:10,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:10,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:10,369 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 8 times [2022-03-15 22:18:10,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:10,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504742210] [2022-03-15 22:18:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:10,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:10,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504742210] [2022-03-15 22:18:10,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504742210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:10,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068433734] [2022-03-15 22:18:10,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:10,408 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:10,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 22:18:10,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:10,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:10,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:18:10,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:10,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:10,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068433734] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:10,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:10,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:18:10,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920071607] [2022-03-15 22:18:10,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:10,572 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:10,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:18:10,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:11,121 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [20801#(or (< (+ j 1) M) (<= M j)), 20808#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 20803#(or (< j M) (< i N)), 20804#(or (<= N i) (< (+ i 1) N) (< j M)), 20800#(< j M), 20802#(or (<= N i) (<= (+ 2 i) N)), 20809#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 20806#(or (< (+ 2 j) M) (<= M (+ j 1))), 20805#(or (<= N i) (<= (+ M i 1) (+ N j))), 20807#(or (<= N (+ i 1)) (<= (+ 3 i) N))] [2022-03-15 22:18:11,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:18:11,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:18:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:18:11,122 INFO L87 Difference]: Start difference. First operand 946 states and 3838 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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) [2022-03-15 22:18:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:11,967 INFO L93 Difference]: Finished difference Result 2684 states and 9854 transitions. [2022-03-15 22:18:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:18:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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 16 [2022-03-15 22:18:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:11,982 INFO L225 Difference]: With dead ends: 2684 [2022-03-15 22:18:11,982 INFO L226 Difference]: Without dead ends: 2684 [2022-03-15 22:18:11,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:18:11,983 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:11,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:18:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2022-03-15 22:18:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1140. [2022-03-15 22:18:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 4.183494293239684) internal successors, (4765), 1139 states have internal predecessors, (4765), 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) [2022-03-15 22:18:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 4765 transitions. [2022-03-15 22:18:12,022 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 4765 transitions. Word has length 16 [2022-03-15 22:18:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:12,022 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 4765 transitions. [2022-03-15 22:18:12,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 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) [2022-03-15 22:18:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 4765 transitions. [2022-03-15 22:18:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:12,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:12,026 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:12,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:12,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:18:12,248 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 9 times [2022-03-15 22:18:12,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:12,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652092081] [2022-03-15 22:18:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:12,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:12,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652092081] [2022-03-15 22:18:12,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652092081] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:12,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151696624] [2022-03-15 22:18:12,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:12,300 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:12,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:18:12,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:18:12,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:12,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:12,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:12,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:12,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151696624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:12,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:12,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:18:12,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129993620] [2022-03-15 22:18:12,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:12,508 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:12,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:18:12,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:13,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [25959#(or (<= (+ 2 k j) (+ N M)) (< i N)), 25944#(or (<= (+ j 1) M) (< i N)), 25947#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 25943#(or (<= N i) (< (+ i 1) N) (< k N)), 25951#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 25953#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 25952#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 25960#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 25963#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 25939#(< i N), 25945#(or (<= N i) (< (+ i 1) N) (< j M)), 25950#(or (<= (+ 2 j) M) (< i N)), 25961#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 25954#(or (< k N) (<= (+ j 1) M)), 25940#(or (<= N i) (< (+ i 1) N)), 25955#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 25956#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 25957#(or (< j M) (< k N) (< i N)), 25941#(< k N), 25946#(or (<= N (+ i 1)) (< (+ 2 i) N)), 25958#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 25948#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 25964#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 25962#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 25949#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 25942#(or (< k N) (< i N))] [2022-03-15 22:18:13,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:18:13,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:18:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:18:13,313 INFO L87 Difference]: Start difference. First operand 1140 states and 4765 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 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) [2022-03-15 22:18:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:16,565 INFO L93 Difference]: Finished difference Result 2135 states and 7891 transitions. [2022-03-15 22:18:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:18:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 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 16 [2022-03-15 22:18:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:16,574 INFO L225 Difference]: With dead ends: 2135 [2022-03-15 22:18:16,574 INFO L226 Difference]: Without dead ends: 2135 [2022-03-15 22:18:16,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7429 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:18:16,577 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 504 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:16,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:18:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2022-03-15 22:18:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1312. [2022-03-15 22:18:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 4.276125095347063) internal successors, (5606), 1311 states have internal predecessors, (5606), 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) [2022-03-15 22:18:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 5606 transitions. [2022-03-15 22:18:16,642 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 5606 transitions. Word has length 16 [2022-03-15 22:18:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:16,643 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 5606 transitions. [2022-03-15 22:18:16,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 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) [2022-03-15 22:18:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 5606 transitions. [2022-03-15 22:18:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:16,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:16,647 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:16,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:16,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:16,867 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 10 times [2022-03-15 22:18:16,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:16,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511875450] [2022-03-15 22:18:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:16,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:16,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511875450] [2022-03-15 22:18:16,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511875450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:16,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445640967] [2022-03-15 22:18:16,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:16,917 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:16,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:18:16,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:16,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:16,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:16,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:17,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:17,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445640967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:17,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:17,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:18:17,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228691540] [2022-03-15 22:18:17,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:17,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:17,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:18:17,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:17,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31056#(or (< j M) (< i N)), 31061#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31063#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31059#(or (<= N k) (< i N)), 31058#(or (<= N i) (< (+ i 1) N) (< j M)), 31066#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31057#(or (<= N i) (< (+ i 1) N)), 31062#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 31054#(< i N), 31065#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31060#(or (<= N i) (< (+ i 1) N) (<= N k)), 31064#(or (<= (+ N M) (+ k j 1)) (< i N)), 31055#(< j M)] [2022-03-15 22:18:17,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:18:17,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:18:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:18:17,563 INFO L87 Difference]: Start difference. First operand 1312 states and 5606 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2022-03-15 22:18:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:19,021 INFO L93 Difference]: Finished difference Result 4192 states and 16930 transitions. [2022-03-15 22:18:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:18:19,021 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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 16 [2022-03-15 22:18:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:19,045 INFO L225 Difference]: With dead ends: 4192 [2022-03-15 22:18:19,045 INFO L226 Difference]: Without dead ends: 4137 [2022-03-15 22:18:19,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:18:19,047 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:19,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2022-03-15 22:18:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 1974. [2022-03-15 22:18:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 4.596553471870249) internal successors, (9069), 1973 states have internal predecessors, (9069), 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) [2022-03-15 22:18:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 9069 transitions. [2022-03-15 22:18:19,124 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 9069 transitions. Word has length 16 [2022-03-15 22:18:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:19,124 INFO L470 AbstractCegarLoop]: Abstraction has 1974 states and 9069 transitions. [2022-03-15 22:18:19,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2022-03-15 22:18:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 9069 transitions. [2022-03-15 22:18:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:19,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:19,130 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:19,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:19,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:19,353 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 11 times [2022-03-15 22:18:19,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:19,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628694679] [2022-03-15 22:18:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:19,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:19,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628694679] [2022-03-15 22:18:19,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628694679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:19,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992210362] [2022-03-15 22:18:19,400 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:19,404 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:18:19,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:19,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:19,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:19,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:19,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:19,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992210362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:19,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:19,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:18:19,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108495920] [2022-03-15 22:18:19,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:19,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:19,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:18:19,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:20,034 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [39434#(or (<= N i) (< (+ i 1) N) (<= M j)), 39440#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 39435#(or (<= N (+ i 1)) (< (+ 2 i) N)), 39436#(< k N), 39438#(or (<= N i) (< (+ i 1) N) (< k N)), 39433#(or (< i N) (<= M j)), 39439#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 39437#(or (< k N) (< i N)), 39443#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 39441#(or (<= (+ N M) (+ k j 1)) (< i N)), 39432#(or (<= N i) (< (+ i 1) N)), 39442#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 39431#(< i N)] [2022-03-15 22:18:20,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:18:20,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:20,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:18:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:18:20,036 INFO L87 Difference]: Start difference. First operand 1974 states and 9069 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2022-03-15 22:18:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:21,993 INFO L93 Difference]: Finished difference Result 4098 states and 16712 transitions. [2022-03-15 22:18:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:18:21,994 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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 16 [2022-03-15 22:18:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:22,008 INFO L225 Difference]: With dead ends: 4098 [2022-03-15 22:18:22,008 INFO L226 Difference]: Without dead ends: 4039 [2022-03-15 22:18:22,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4859 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:18:22,011 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:22,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2022-03-15 22:18:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2108. [2022-03-15 22:18:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 4.643569055529189) internal successors, (9784), 2107 states have internal predecessors, (9784), 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) [2022-03-15 22:18:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 9784 transitions. [2022-03-15 22:18:22,116 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 9784 transitions. Word has length 16 [2022-03-15 22:18:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:22,117 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 9784 transitions. [2022-03-15 22:18:22,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 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) [2022-03-15 22:18:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 9784 transitions. [2022-03-15 22:18:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:22,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:22,125 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:22,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:22,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:22,339 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:18:22,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:22,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351091759] [2022-03-15 22:18:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:22,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:22,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351091759] [2022-03-15 22:18:22,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351091759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:22,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216384832] [2022-03-15 22:18:22,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:22,564 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:22,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:18:22,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:22,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:18:22,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:22,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 22:18:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:22,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:23,012 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:18:23,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 96 [2022-03-15 22:18:23,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:23,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:23,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:23,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2022-03-15 22:18:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:23,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216384832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:23,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:23,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 22:18:23,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933106306] [2022-03-15 22:18:23,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:23,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:23,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:18:23,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:27,682 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [48054#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 48067#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 48056#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 48093#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 48089#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48080#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 48062#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 48063#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 48066#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N)) (or (< j M) (<= (+ (select A (+ (- 2) N)) (select A k) (select A (+ (- 1) N))) sum1) (< (+ 3 k) N)) (or (< j M) (<= sum1 (+ (select A (+ (- 2) N)) (select A k) (select A (+ (- 1) N)))) (< (+ 3 k) N))), 48084#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))) (or (< j M) (<= (+ k 1) i))), 48058#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 48055#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 48065#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 48085#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48090#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48083#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 48077#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 48088#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48069#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 48073#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 48071#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 48064#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 48068#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 48072#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 48059#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 48074#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 48078#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 48079#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 48086#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48060#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 48081#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 48091#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 48057#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 48092#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48075#(and (or (<= sum1 (+ (select A (+ (- 1) i)) (select A k))) (< j M) (< (+ 2 k) i)) (or (= sum2 0) (< j M) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= (+ (select A (+ (- 1) i)) (select A k)) sum1) (< (+ 2 k) i))), 48070#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 48082#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 48061#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 48076#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 48087#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)))] [2022-03-15 22:18:27,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:18:27,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:18:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=3522, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:18:27,683 INFO L87 Difference]: Start difference. First operand 2108 states and 9784 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 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) [2022-03-15 22:18:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:46,140 INFO L93 Difference]: Finished difference Result 3015 states and 12757 transitions. [2022-03-15 22:18:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-03-15 22:18:46,143 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 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 [2022-03-15 22:18:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:46,154 INFO L225 Difference]: With dead ends: 3015 [2022-03-15 22:18:46,154 INFO L226 Difference]: Without dead ends: 2973 [2022-03-15 22:18:46,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16518 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=6819, Invalid=40487, Unknown=0, NotChecked=0, Total=47306 [2022-03-15 22:18:46,157 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 859 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:46,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 0 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:18:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-03-15 22:18:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2215. [2022-03-15 22:18:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 4.625112917795844) internal successors, (10240), 2214 states have internal predecessors, (10240), 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) [2022-03-15 22:18:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 10240 transitions. [2022-03-15 22:18:46,237 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 10240 transitions. Word has length 17 [2022-03-15 22:18:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:46,237 INFO L470 AbstractCegarLoop]: Abstraction has 2215 states and 10240 transitions. [2022-03-15 22:18:46,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 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) [2022-03-15 22:18:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 10240 transitions. [2022-03-15 22:18:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:46,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:46,245 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:46,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:46,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:46,459 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:18:46,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:46,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977835669] [2022-03-15 22:18:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:46,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:46,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977835669] [2022-03-15 22:18:46,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977835669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:46,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138649198] [2022-03-15 22:18:46,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:46,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:46,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:46,521 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:46,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:18:46,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:18:46,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:46,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:18:46,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:46,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:46,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138649198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:46,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:46,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 22:18:46,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526857057] [2022-03-15 22:18:46,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:46,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:46,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:18:46,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:47,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [55970#(or (<= N k) (< (+ k 1) N)), 55973#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 55983#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 55968#(or (<= N i) (< j M) (< k N)), 55975#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 55958#(< k N), 55971#(or (< j M) (<= N k) (< (+ k 1) N)), 55966#(or (< j M) (< k N)), 55981#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 55979#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 55959#(or (<= (+ N 1) i) (< k N)), 55963#(or (< j M) (<= (+ N 1) i)), 55976#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 55960#(or (<= N i) (< k N)), 55987#(or (< j M) (<= k (+ 2 i))), 55986#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 55974#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 55980#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 55964#(or (<= N i) (< j M)), 55962#(< j M), 55978#(or (<= N i) (<= N k) (< (+ k 1) N)), 55951#(or (< j M) (<= k (+ i 1))), 55985#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 55961#(or (<= N (+ i 1)) (< k N)), 55965#(or (<= N (+ i 1)) (< j M)), 55984#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 55988#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 55972#(or (<= N (+ k 1)) (< (+ 2 k) N)), 55982#(or (<= N (+ 2 i)) (< j M)), 55969#(or (<= N (+ i 1)) (< j M) (< k N)), 55967#(or (< j M) (<= (+ N 1) i) (< k N)), 55977#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N))] [2022-03-15 22:18:47,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:18:47,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:47,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:18:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1765, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:18:47,867 INFO L87 Difference]: Start difference. First operand 2215 states and 10240 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 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) [2022-03-15 22:18:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:50,041 INFO L93 Difference]: Finished difference Result 2815 states and 12315 transitions. [2022-03-15 22:18:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:18:50,041 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 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 [2022-03-15 22:18:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:50,051 INFO L225 Difference]: With dead ends: 2815 [2022-03-15 22:18:50,051 INFO L226 Difference]: Without dead ends: 2799 [2022-03-15 22:18:50,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3325 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2699, Invalid=10411, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:18:50,053 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:50,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:18:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2022-03-15 22:18:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2316. [2022-03-15 22:18:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 4.6030237580993525) internal successors, (10656), 2315 states have internal predecessors, (10656), 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) [2022-03-15 22:18:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 10656 transitions. [2022-03-15 22:18:50,118 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 10656 transitions. Word has length 17 [2022-03-15 22:18:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:50,118 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 10656 transitions. [2022-03-15 22:18:50,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 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) [2022-03-15 22:18:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 10656 transitions. [2022-03-15 22:18:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:50,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:50,125 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:50,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:50,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 22:18:50,339 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:50,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 12 times [2022-03-15 22:18:50,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:50,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631929245] [2022-03-15 22:18:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:50,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:50,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631929245] [2022-03-15 22:18:50,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631929245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:50,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019389004] [2022-03-15 22:18:50,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:50,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:50,551 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:50,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:18:50,575 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:18:50,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:50,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:18:50,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:50,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:50,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:50,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:50,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-03-15 22:18:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:50,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:50,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:51,068 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:18:51,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 29 treesize of output 114 [2022-03-15 22:18:52,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:52,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 72 [2022-03-15 22:18:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:52,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019389004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:52,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:52,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 22:18:52,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1650635063] [2022-03-15 22:18:52,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:52,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:52,492 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:18:52,492 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:55,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [63700#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 63706#(and (or (not (< (+ j 1) M)) (<= (+ k 1) N) (= (+ (select A i) (* (- 1) (select A k))) 0) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (not (< (+ j 1) M)) (= (+ (select A i) (* (- 1) (select A k))) 0) (< (+ 2 j) M) (< i (+ k 1))) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1))), 63709#(and (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) sum1) sum2)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M)) (or (<= (+ 3 i) N) (< j M) (<= sum2 (+ (select A i) sum1)))), 63711#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ k 1) N) (< (+ 2 j) M)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (< (+ 2 j) M)) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (<= (+ 3 i) N) (not (< (+ j 1) M)) (< (+ 2 j) M))), 63702#(and (or (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0) (< i (+ k 1))) (or (<= (+ k 1) N) (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0)) (or (< j M) (<= sum2 sum1) (<= (+ 2 i) N)) (or (<= sum1 sum2) (< j M) (<= (+ 2 i) N))), 63698#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)))), 63696#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 63693#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 63701#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 63707#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 63708#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 63699#(and (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)) (< i N)) (or (< (+ j 1) M) (not (< j M)) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1))), 63710#(and (or (<= (+ 3 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ j 1) M) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 63703#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2) sum1) (<= (+ 2 i) N)) (or (< (+ j 1) M) (= (+ (select A i) (* (- 1) (select A k))) 0) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (<= (+ k 1) N) (= (+ (select A i) (* (- 1) (select A k))) 0) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= sum1 (+ (select A j) sum2)) (<= (+ 2 i) N))), 63697#(and (or (< j M) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (< j M) (<= sum1 (+ sum2 (select A k))) (< i N))), 63713#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 63705#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (< (+ 2 j) M) (< i N)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (< (+ 2 j) M) (< i N))), 63694#(and (or (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k))))), 63704#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (< (+ 2 j) M)) (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (< (+ 2 j) M))), 63695#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 63712#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:18:55,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:18:55,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:18:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:18:55,607 INFO L87 Difference]: Start difference. First operand 2316 states and 10656 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 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) [2022-03-15 22:19:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:04,672 INFO L93 Difference]: Finished difference Result 3976 states and 15449 transitions. [2022-03-15 22:19:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:19:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 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 [2022-03-15 22:19:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:04,685 INFO L225 Difference]: With dead ends: 3976 [2022-03-15 22:19:04,686 INFO L226 Difference]: Without dead ends: 3944 [2022-03-15 22:19:04,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2229, Invalid=13271, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:19:04,687 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:04,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:19:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2022-03-15 22:19:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 2434. [2022-03-15 22:19:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 4.577887381833128) internal successors, (11138), 2433 states have internal predecessors, (11138), 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) [2022-03-15 22:19:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 11138 transitions. [2022-03-15 22:19:04,758 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 11138 transitions. Word has length 17 [2022-03-15 22:19:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:04,759 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 11138 transitions. [2022-03-15 22:19:04,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 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) [2022-03-15 22:19:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 11138 transitions. [2022-03-15 22:19:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:04,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:04,766 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:04,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:04,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:19:04,989 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 13 times [2022-03-15 22:19:04,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:04,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511350937] [2022-03-15 22:19:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:05,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:05,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511350937] [2022-03-15 22:19:05,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511350937] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:05,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387470998] [2022-03-15 22:19:05,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:05,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:05,196 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:05,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:19:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:05,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:05,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:05,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:05,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:05,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2022-03-15 22:19:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:05,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:06,020 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:19:06,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 141 [2022-03-15 22:19:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:11,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387470998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:11,909 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:11,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 22:19:11,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117535274] [2022-03-15 22:19:11,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:11,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:11,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:19:11,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:14,434 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [72850#(and (or (not (<= k i)) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ M i) (+ N j)) (not (< j M)) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1)) (or (<= (+ k 1) N) (<= k i) (not (< j M))) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (< i (+ k 1)) (<= M j)) (or (not (= k i)) (<= (+ M i) (+ N j)) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2)) (<= M j))), 72845#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 72842#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 72858#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)) (<= M j)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (<= M j))), 72843#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 72844#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 72853#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< (+ (select A j) sum2) (+ (select A i) sum1 1)) (<= M j))), 72847#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 72852#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 72857#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)) 1)) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (<= M j))), 72846#(and (or (<= sum1 (+ (select A j) sum2)) (< i N) (<= M j)) (or (< (+ (select A j) sum2) (+ sum1 1)) (< i N) (<= M j))), 72855#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 72848#(and (or (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= M (+ j 1))) (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (<= M (+ j 1)))), 72856#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 72854#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 72851#(and (or (<= (+ M 1) N) (not (< j M))) (or (not (<= (+ j 1) i)) (not (< j M)) (<= (+ (select A j) sum2) sum1)) (or (not (<= (+ j 1) i)) (not (< j M)) (<= sum1 (+ (select A j) sum2))) (or (< i (+ 2 j)) (<= M j)) (or (not (<= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (<= (+ k 1) N) (not (< j M)))), 72849#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (<= M (+ j 1)) (< i N)) (or (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= M (+ j 1)) (< i N)))] [2022-03-15 22:19:14,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:19:14,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:19:14,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:19:14,435 INFO L87 Difference]: Start difference. First operand 2434 states and 11138 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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) [2022-03-15 22:19:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:42,050 INFO L93 Difference]: Finished difference Result 5708 states and 20982 transitions. [2022-03-15 22:19:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-03-15 22:19:42,050 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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 [2022-03-15 22:19:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:42,064 INFO L225 Difference]: With dead ends: 5708 [2022-03-15 22:19:42,064 INFO L226 Difference]: Without dead ends: 5675 [2022-03-15 22:19:42,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17475 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=8070, Invalid=39672, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 22:19:42,067 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 635 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:42,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 0 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:19:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2022-03-15 22:19:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 2560. [2022-03-15 22:19:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 4.572880031262212) internal successors, (11702), 2559 states have internal predecessors, (11702), 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) [2022-03-15 22:19:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 11702 transitions. [2022-03-15 22:19:42,152 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 11702 transitions. Word has length 17 [2022-03-15 22:19:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:42,153 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 11702 transitions. [2022-03-15 22:19:42,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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) [2022-03-15 22:19:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 11702 transitions. [2022-03-15 22:19:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:42,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:42,160 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:42,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:42,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:42,375 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 14 times [2022-03-15 22:19:42,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:42,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938788251] [2022-03-15 22:19:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:42,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:42,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938788251] [2022-03-15 22:19:42,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938788251] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:42,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616281776] [2022-03-15 22:19:42,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:42,577 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:42,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:19:42,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:42,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:42,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:42,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:42,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2022-03-15 22:19:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:42,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:43,147 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:19:43,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 30 treesize of output 115 [2022-03-15 22:19:43,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,984 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:43,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 72 [2022-03-15 22:19:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:44,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616281776] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:44,149 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:44,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:19:44,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438637853] [2022-03-15 22:19:44,149 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:44,150 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:44,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:19:44,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:47,909 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [84173#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 84166#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 84171#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84179#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 84172#(and (or (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (not (< i N)) (<= k (+ i 1))) (or (= (select A k) (select A (+ i 1))) (not (< i N))) (or (not (< i N)) (<= (+ (select A i) sum1) sum2))), 84163#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84174#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 84162#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 84189#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84165#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 84164#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 84176#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 84181#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 84177#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 84169#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 84187#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 84191#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84170#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 84190#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84168#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 84180#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) sum2 (select A k)) sum1) (not (< j M))) (or (<= (+ 3 k) N) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 84178#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 84186#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 84160#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 84167#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84184#(and (or (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k)))) (or (< j M) (<= (+ k 1) i))), 84161#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 84188#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 84185#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M)))), 84182#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 84183#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 84175#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 84192#(and (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (= (select A k) (select A (+ i 1))) (< i k) (not (< i N))) (or (<= (+ k j) (+ M i 1)) (not (< i N))))] [2022-03-15 22:19:47,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:19:47,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:19:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2931, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:19:47,911 INFO L87 Difference]: Start difference. First operand 2560 states and 11702 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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) [2022-03-15 22:20:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:11,245 INFO L93 Difference]: Finished difference Result 4670 states and 17786 transitions. [2022-03-15 22:20:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2022-03-15 22:20:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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 [2022-03-15 22:20:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:11,255 INFO L225 Difference]: With dead ends: 4670 [2022-03-15 22:20:11,255 INFO L226 Difference]: Without dead ends: 4600 [2022-03-15 22:20:11,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 35 SyntacticMatches, 14 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23794 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=8380, Invalid=59480, Unknown=0, NotChecked=0, Total=67860 [2022-03-15 22:20:11,257 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 861 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:11,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 0 Invalid, 4081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:20:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2022-03-15 22:20:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 2584. [2022-03-15 22:20:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2583 states have (on average 4.569879984514131) internal successors, (11804), 2583 states have internal predecessors, (11804), 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) [2022-03-15 22:20:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 11804 transitions. [2022-03-15 22:20:11,323 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 11804 transitions. Word has length 17 [2022-03-15 22:20:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:11,323 INFO L470 AbstractCegarLoop]: Abstraction has 2584 states and 11804 transitions. [2022-03-15 22:20:11,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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) [2022-03-15 22:20:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 11804 transitions. [2022-03-15 22:20:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:11,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:11,330 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:11,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:11,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:11,543 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 15 times [2022-03-15 22:20:11,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:11,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190530302] [2022-03-15 22:20:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:11,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:11,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190530302] [2022-03-15 22:20:11,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190530302] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:11,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267391006] [2022-03-15 22:20:11,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:20:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:11,832 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:11,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:20:11,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:20:11,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:11,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:20:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:12,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:12,161 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:20:12,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2022-03-15 22:20:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:12,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:12,551 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:20:12,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 141 [2022-03-15 22:20:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:16,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267391006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:16,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:16,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 22:20:16,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569028829] [2022-03-15 22:20:16,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:16,711 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:16,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:20:16,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:20,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [94573#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 94590#(and (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N)) (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 94595#(and (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0) (< k N)) (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (< (+ 3 i) N) (< (+ 2 k) (+ N M))) (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ 2 k) (+ N M)))), 94577#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N))) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 94579#(and (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (not (< i N)) (= j 0)) (or (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)))), 94575#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94589#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= j 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= 2 M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) sum2)))), 94594#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= j 0) (< k N)) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) (+ N M))) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (< (+ 2 k) (+ N M)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2))) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 2 k) (+ N M)))), 94572#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94561#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 94562#(and (or (< sum2 (+ sum1 1)) (<= (+ j 1) M) (< i N)) (or (<= sum1 sum2) (<= (+ j 1) M) (< i N))), 94582#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 94581#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ j 1) M)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ j 1) M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94576#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (<= (+ j 1) M)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (<= (+ j 1) M))), 94563#(and (or (<= (+ 2 j) M) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< i N))), 94580#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ j 1) M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (<= (+ j 1) M))), 94591#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= 2 M)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0)) (or (not (< (+ 2 i) N)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 3 j) M) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) sum2)) (<= (+ 3 j) M) (< (+ 3 i) N))), 94565#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 94570#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 94586#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 94568#(and (or (<= (+ 2 j) M) (< k N) (<= sum1 (+ (select A j) sum2))) (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< k N))), 94566#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 94592#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94571#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 94584#(and (or (<= (+ k 1) N) (= j 0) (< i N)) (or (<= (+ k 1) N) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) sum1) (< (+ 2 k) (+ N M)) (< i N)) (or (<= sum1 (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (<= (+ k 1) N) (< (+ 2 k) (+ N M)) (< i N)) (or (<= (+ k 1) N) (<= (+ 2 k) (+ N M)) (< i N))), 94578#(and (or (<= 2 M) (< i N)) (or (<= (+ 3 j) M) (< i N) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (= j 0) (< i N)) (or (<= (+ 3 j) M) (< i N) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1))), 94588#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 94587#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)))), 94593#(and (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (< k N))), 94564#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 94569#(and (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< k N) (< i N)) (or (<= (+ 2 j) M) (< k N) (<= sum1 (+ (select A j) sum2)) (< i N))), 94583#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N))), 94585#(and (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 2 k) (+ N M))) (or (< (+ i 1) N) (not (< i N)) (= j 0) (< k N)) (or (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) sum1)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M))) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M)))), 94574#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 94567#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N)))] [2022-03-15 22:20:20,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:20:20,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:20:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=3452, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 22:20:20,683 INFO L87 Difference]: Start difference. First operand 2584 states and 11804 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 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) [2022-03-15 22:20:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:46,266 INFO L93 Difference]: Finished difference Result 3858 states and 15862 transitions. [2022-03-15 22:20:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 22:20:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 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 [2022-03-15 22:20:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:46,274 INFO L225 Difference]: With dead ends: 3858 [2022-03-15 22:20:46,275 INFO L226 Difference]: Without dead ends: 3833 [2022-03-15 22:20:46,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17828 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=7292, Invalid=43558, Unknown=0, NotChecked=0, Total=50850 [2022-03-15 22:20:46,277 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1080 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:46,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1080 Valid, 0 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:20:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2022-03-15 22:20:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 2611. [2022-03-15 22:20:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 4.563218390804598) internal successors, (11910), 2610 states have internal predecessors, (11910), 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) [2022-03-15 22:20:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 11910 transitions. [2022-03-15 22:20:46,384 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 11910 transitions. Word has length 17 [2022-03-15 22:20:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:46,384 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 11910 transitions. [2022-03-15 22:20:46,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 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) [2022-03-15 22:20:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 11910 transitions. [2022-03-15 22:20:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:46,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:46,390 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:46,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:46,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:20:46,596 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 779712672, now seen corresponding path program 16 times [2022-03-15 22:20:46,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:46,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021735311] [2022-03-15 22:20:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:46,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:46,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021735311] [2022-03-15 22:20:46,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021735311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:46,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178721195] [2022-03-15 22:20:46,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:46,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:46,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:46,821 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:46,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 22:20:46,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:46,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:20:46,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:47,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:47,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:47,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:47,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:47,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:47,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:47,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2022-03-15 22:20:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:47,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:47,370 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:20:47,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 30 treesize of output 115 [2022-03-15 22:20:48,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:48,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:20:48,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 72 [2022-03-15 22:20:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:48,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178721195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:48,690 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:48,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:20:48,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062494395] [2022-03-15 22:20:48,690 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:48,691 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:48,701 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 121 transitions. [2022-03-15 22:20:48,701 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:51,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [104139#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 104129#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 104144#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 104124#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 104145#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104131#(and (or (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (<= 2 M) (< i N)) (or (<= (+ 2 k) N) (= j 0) (< i N)) (or (<= (+ 2 k) N) (<= 2 M) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1))), 104123#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 104138#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 104125#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 104128#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 104151#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (= j 0))), 104143#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 104150#(and (or (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 2 M) (<= (+ (select A i) sum1) (+ (select A j) sum2 (select A k)))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= j 0))), 104148#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104149#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104141#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 104126#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 104127#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 104135#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 104132#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 104137#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 104147#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 104134#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 104130#(and (or (<= (+ 2 k) N) (<= (+ j 1) M) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (<= (+ j 1) M) (< i N))), 104136#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 104140#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 104142#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 104133#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 104152#(and (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (<= 2 M)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 104146#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:20:51,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:20:51,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:20:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2712, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 22:20:51,687 INFO L87 Difference]: Start difference. First operand 2611 states and 11910 transitions. Second operand has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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) [2022-03-15 22:21:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:16,621 INFO L93 Difference]: Finished difference Result 3751 states and 15470 transitions. [2022-03-15 22:21:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-15 22:21:16,621 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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 [2022-03-15 22:21:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:16,629 INFO L225 Difference]: With dead ends: 3751 [2022-03-15 22:21:16,629 INFO L226 Difference]: Without dead ends: 3719 [2022-03-15 22:21:16,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13460 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=6036, Invalid=34970, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 22:21:16,631 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 955 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:16,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 0 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 22:21:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-03-15 22:21:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 2635. [2022-03-15 22:21:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 4.56795747911921) internal successors, (12032), 2634 states have internal predecessors, (12032), 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) [2022-03-15 22:21:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 12032 transitions. [2022-03-15 22:21:16,697 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 12032 transitions. Word has length 17 [2022-03-15 22:21:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:16,697 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 12032 transitions. [2022-03-15 22:21:16,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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) [2022-03-15 22:21:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 12032 transitions. [2022-03-15 22:21:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:16,726 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:16,726 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:16,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:16,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 22:21:16,927 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 8117336, now seen corresponding path program 17 times [2022-03-15 22:21:16,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:16,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942263789] [2022-03-15 22:21:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:17,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:17,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942263789] [2022-03-15 22:21:17,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942263789] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:17,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835027378] [2022-03-15 22:21:17,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:17,116 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:17,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 22:21:17,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:21:17,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:17,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:21:17,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:17,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:17,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:17,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:17,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:17,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-03-15 22:21:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:17,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:17,750 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:17,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 30 treesize of output 111 [2022-03-15 22:21:18,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:18,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:18,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 72 [2022-03-15 22:21:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:18,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835027378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:18,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:18,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:21:18,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918431139] [2022-03-15 22:21:18,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:18,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:18,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 119 transitions. [2022-03-15 22:21:18,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:20,480 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [113598#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 113602#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 113606#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 113603#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 113591#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 113607#(and (or (<= (+ 2 k) N) (<= N k) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (<= N k) (< i N))), 113593#(and (or (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< i N))), 113610#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 113599#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 113611#(and (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (< (+ k 1) N))), 113597#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)))))), 113608#(and (or (not (< k N)) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (<= (+ (select A i) sum1) (+ (select A j) sum2 (select A k))))), 113594#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 113600#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 113605#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 113601#(and (or (< k N) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< k N) (< i N))), 113596#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 113592#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 113609#(and (or (not (< k N)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 113595#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 113604#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (< k N)))] [2022-03-15 22:21:20,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:21:20,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:21:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:21:20,481 INFO L87 Difference]: Start difference. First operand 2635 states and 12032 transitions. Second operand has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 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) [2022-03-15 22:21:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:30,789 INFO L93 Difference]: Finished difference Result 3693 states and 15136 transitions. [2022-03-15 22:21:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:21:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 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 [2022-03-15 22:21:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:30,798 INFO L225 Difference]: With dead ends: 3693 [2022-03-15 22:21:30,798 INFO L226 Difference]: Without dead ends: 3656 [2022-03-15 22:21:30,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1697, Invalid=14305, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 22:21:30,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 631 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:30,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 0 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:21:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-03-15 22:21:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 2644. [2022-03-15 22:21:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 4.5701853953840335) internal successors, (12079), 2643 states have internal predecessors, (12079), 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) [2022-03-15 22:21:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 12079 transitions. [2022-03-15 22:21:30,858 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 12079 transitions. Word has length 17 [2022-03-15 22:21:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:30,858 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 12079 transitions. [2022-03-15 22:21:30,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 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) [2022-03-15 22:21:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 12079 transitions. [2022-03-15 22:21:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:30,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:30,864 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:30,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:31,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 22:21:31,065 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1479806234, now seen corresponding path program 18 times [2022-03-15 22:21:31,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:31,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501484710] [2022-03-15 22:21:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:31,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:31,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501484710] [2022-03-15 22:21:31,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501484710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:31,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435335094] [2022-03-15 22:21:31,108 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:21:31,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:31,109 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:31,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 22:21:31,133 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:21:31,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:31,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:21:31,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:21:31,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:21:31,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435335094] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:31,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:31,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-03-15 22:21:31,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1076933797] [2022-03-15 22:21:31,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:31,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:31,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 135 transitions. [2022-03-15 22:21:31,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:31,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [122870#(or (<= N i) (< (+ i 1) N) (<= M j)), 122869#(or (<= N i) (< (+ i 1) N) (<= (+ M 1) j)), 122874#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 122875#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 122866#(or (<= N i) (< (+ i 1) N)), 122872#(or (<= N (+ i 1)) (< (+ 2 i) N)), 122871#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 122868#(or (< i N) (<= M j)), 122865#(< i N), 122873#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ M 1) j)), 122867#(or (<= (+ M 1) j) (< i N)), 122847#(or (<= M (+ j 1)) (< i N))] [2022-03-15 22:21:31,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:21:31,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:31,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:21:31,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:21:31,774 INFO L87 Difference]: Start difference. First operand 2644 states and 12079 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 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) [2022-03-15 22:21:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:32,355 INFO L93 Difference]: Finished difference Result 5483 states and 23954 transitions. [2022-03-15 22:21:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 22:21:32,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 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 [2022-03-15 22:21:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:32,368 INFO L225 Difference]: With dead ends: 5483 [2022-03-15 22:21:32,368 INFO L226 Difference]: Without dead ends: 5444 [2022-03-15 22:21:32,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=667, Invalid=1883, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:21:32,369 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:32,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2022-03-15 22:21:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 3223. [2022-03-15 22:21:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 4.65114835505897) internal successors, (14986), 3222 states have internal predecessors, (14986), 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) [2022-03-15 22:21:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 14986 transitions. [2022-03-15 22:21:32,449 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 14986 transitions. Word has length 17 [2022-03-15 22:21:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:32,449 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 14986 transitions. [2022-03-15 22:21:32,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 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) [2022-03-15 22:21:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 14986 transitions. [2022-03-15 22:21:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:32,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:32,456 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:32,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:32,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:32,657 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1028269030, now seen corresponding path program 19 times [2022-03-15 22:21:32,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:32,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972742267] [2022-03-15 22:21:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:32,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:32,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972742267] [2022-03-15 22:21:32,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972742267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:32,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547479799] [2022-03-15 22:21:32,718 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:21:32,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:32,720 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:32,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 22:21:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:32,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:21:32,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:32,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:32,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547479799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:32,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:32,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-15 22:21:32,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951001528] [2022-03-15 22:21:32,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:32,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:32,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 127 transitions. [2022-03-15 22:21:32,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:33,847 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [134994#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 134991#(or (<= N (+ i 1)) (< j M)), 134986#(or (<= N i) (< j M)), 134973#(< j M), 134988#(or (< (+ j 1) M) (<= N i) (<= M j)), 134976#(or (< j M) (<= (+ N 1) i) (< k N)), 134993#(or (<= N (+ i 1)) (< j M) (< k N)), 134989#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 134990#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 134987#(or (<= N i) (< j M) (< k N)), 134995#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 134992#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 134972#(or (<= (+ N 1) i) (< k N)), 134981#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 134971#(< k N), 134978#(or (< (+ j 1) M) (<= (+ N 1) i) (<= M j)), 134984#(or (<= N (+ i 1)) (< k N)), 134977#(or (< (+ j 1) M) (<= M j)), 134974#(or (< j M) (< k N)), 134975#(or (< j M) (<= (+ N 1) i)), 134983#(or (<= N i) (< k N)), 134985#(or (<= N (+ 2 i)) (< k N)), 134996#(or (<= (+ N j) (+ 2 M i)) (< k N)), 134982#(or (< (+ j 1) M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N) (<= M j)), 134979#(or (< (+ j 1) M) (< k N) (<= M j)), 134980#(or (< (+ j 1) M) (<= (+ N 1) i) (< k N) (<= M j))] [2022-03-15 22:21:33,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:21:33,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:33,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:21:33,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1611, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:21:33,848 INFO L87 Difference]: Start difference. First operand 3223 states and 14986 transitions. Second operand has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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) [2022-03-15 22:21:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:36,747 INFO L93 Difference]: Finished difference Result 3994 states and 17147 transitions. [2022-03-15 22:21:36,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-15 22:21:36,748 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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 [2022-03-15 22:21:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:36,757 INFO L225 Difference]: With dead ends: 3994 [2022-03-15 22:21:36,757 INFO L226 Difference]: Without dead ends: 3977 [2022-03-15 22:21:36,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6540 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4219, Invalid=18131, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 22:21:36,758 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:36,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:21:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2022-03-15 22:21:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3302. [2022-03-15 22:21:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3301 states have (on average 4.6201151166313235) internal successors, (15251), 3301 states have internal predecessors, (15251), 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) [2022-03-15 22:21:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 15251 transitions. [2022-03-15 22:21:36,827 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 15251 transitions. Word has length 17 [2022-03-15 22:21:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:36,827 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 15251 transitions. [2022-03-15 22:21:36,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 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) [2022-03-15 22:21:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 15251 transitions. [2022-03-15 22:21:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:36,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:36,837 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:36,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:37,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:37,038 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 781587280, now seen corresponding path program 10 times [2022-03-15 22:21:37,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:37,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339109564] [2022-03-15 22:21:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:37,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:37,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339109564] [2022-03-15 22:21:37,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339109564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:37,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177338131] [2022-03-15 22:21:37,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:37,116 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:37,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 22:21:37,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:37,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:37,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:37,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:37,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:37,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177338131] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:37,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:37,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 22:21:37,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [90585162] [2022-03-15 22:21:37,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:37,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:37,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 22:21:37,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:38,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [145933#(or (<= N (+ k 1)) (< i N)), 145943#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 2 k))), 145938#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 145937#(or (<= N (+ 2 k)) (< i N)), 145928#(< i N), 145941#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 145939#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 145942#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 145930#(or (<= N (+ i 1)) (< (+ 2 i) N)), 145934#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 145935#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 145940#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 145931#(or (<= N k) (< i N)), 145929#(or (<= N i) (< (+ i 1) N)), 145932#(or (<= N i) (< (+ i 1) N) (<= N k)), 145936#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:21:38,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:21:38,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:38,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:21:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:21:38,172 INFO L87 Difference]: Start difference. First operand 3302 states and 15251 transitions. Second operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 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) [2022-03-15 22:21:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:39,953 INFO L93 Difference]: Finished difference Result 11462 states and 52197 transitions. [2022-03-15 22:21:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 22:21:39,954 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:21:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:39,997 INFO L225 Difference]: With dead ends: 11462 [2022-03-15 22:21:39,997 INFO L226 Difference]: Without dead ends: 11428 [2022-03-15 22:21:39,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3923 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2982, Invalid=8360, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:21:39,999 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:39,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:21:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11428 states. [2022-03-15 22:21:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11428 to 5139. [2022-03-15 22:21:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5138 states have (on average 4.742312183729077) internal successors, (24366), 5138 states have internal predecessors, (24366), 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) [2022-03-15 22:21:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 24366 transitions. [2022-03-15 22:21:40,277 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 24366 transitions. Word has length 18 [2022-03-15 22:21:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:40,278 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 24366 transitions. [2022-03-15 22:21:40,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 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) [2022-03-15 22:21:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 24366 transitions. [2022-03-15 22:21:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:40,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:40,290 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:40,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:40,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:40,491 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2021259246, now seen corresponding path program 11 times [2022-03-15 22:21:40,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:40,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773030622] [2022-03-15 22:21:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:40,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:40,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:40,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773030622] [2022-03-15 22:21:40,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773030622] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:40,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929207246] [2022-03-15 22:21:40,557 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:40,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:40,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:40,558 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:40,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 22:21:40,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:21:40,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:40,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:40,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:40,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:40,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929207246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:40,685 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:40,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-03-15 22:21:40,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707428068] [2022-03-15 22:21:40,685 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:40,686 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:40,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 22:21:40,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:42,359 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [167959#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 167964#(or (<= N i) (< (+ i 1) N) (< j M)), 167978#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 167965#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 167943#(< i N), 167951#(or (<= (+ k 1) N) (< j M)), 167986#(or (<= (+ 2 k) i) (< j M) (<= N k)), 167962#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 167974#(or (< j M) (<= (+ k 1) i)), 167980#(or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 167985#(or (<= (+ 3 k) i) (< j M) (<= N k)), 167944#(or (< k N) (< i N)), 167988#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 167975#(or (< (+ i 4) N) (<= N (+ 3 i))), 167977#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 167948#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 167963#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 167972#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 167936#(or (<= k i) (< j M)), 167947#(or (<= N i) (< (+ i 1) N) (< k N)), 167949#(or (<= N k) (<= (+ k 4) N)), 167967#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 167946#(or (<= N i) (< (+ i 1) N)), 167954#(or (< j M) (<= N k) (<= (+ k 4) N)), 167973#(or (<= (+ 2 k) i) (< j M)), 167984#(or (<= (+ k 1) i) (<= N k)), 167960#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 167971#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 167966#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 167981#(or (< j M) (<= k (+ i 1))), 167953#(or (<= (+ 3 k) N) (< j M)), 167983#(or (<= (+ 2 k) i) (<= N k)), 167956#(or (< j M) (< k N) (< i N)), 167982#(or (<= (+ 3 k) i) (<= N k)), 167976#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 167958#(or (<= N (+ i 1)) (< (+ 2 i) N)), 167979#(or (< (+ i 4) N) (<= (+ 2 k) N) (<= N (+ 3 i))), 167961#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 167957#(or (<= (+ 2 k) N) (< j M) (< i N)), 167969#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 167987#(or (< j M) (<= (+ k 1) i) (<= N k)), 167970#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 167968#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 167955#(or (< j M) (< i N)), 167952#(or (<= (+ 2 k) N) (< j M)), 167950#(< j M), 167945#(or (<= (+ 2 k) N) (< i N))] [2022-03-15 22:21:42,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 22:21:42,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 22:21:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2957, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:21:42,361 INFO L87 Difference]: Start difference. First operand 5139 states and 24366 transitions. Second operand has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 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) [2022-03-15 22:21:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:46,966 INFO L93 Difference]: Finished difference Result 6469 states and 28855 transitions. [2022-03-15 22:21:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-15 22:21:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:21:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:47,007 INFO L225 Difference]: With dead ends: 6469 [2022-03-15 22:21:47,007 INFO L226 Difference]: Without dead ends: 6469 [2022-03-15 22:21:47,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9141 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5661, Invalid=25139, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 22:21:47,009 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1002 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:47,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1002 Valid, 0 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:21:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2022-03-15 22:21:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 5330. [2022-03-15 22:21:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5330 states, 5329 states have (on average 4.722274347907675) internal successors, (25165), 5329 states have internal predecessors, (25165), 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) [2022-03-15 22:21:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 25165 transitions. [2022-03-15 22:21:47,122 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 25165 transitions. Word has length 18 [2022-03-15 22:21:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:47,122 INFO L470 AbstractCegarLoop]: Abstraction has 5330 states and 25165 transitions. [2022-03-15 22:21:47,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 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) [2022-03-15 22:21:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 25165 transitions. [2022-03-15 22:21:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:47,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:47,133 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:47,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 22:21:47,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 22:21:47,334 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1953981816, now seen corresponding path program 20 times [2022-03-15 22:21:47,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:47,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649765822] [2022-03-15 22:21:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:47,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:47,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649765822] [2022-03-15 22:21:47,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649765822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:47,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855080865] [2022-03-15 22:21:47,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:47,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:47,405 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:47,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 22:21:47,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:47,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:47,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:21:47,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:47,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:47,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855080865] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:47,532 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:47,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 22:21:47,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52732841] [2022-03-15 22:21:47,532 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:47,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:47,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:21:47,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:48,820 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [185472#(or (<= N (+ k 1)) (< j M)), 185487#(or (<= N (+ i 1)) (< (+ 2 i) N)), 185495#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 185494#(or (< (+ j 1) M) (<= i k) (<= M j)), 185479#(or (<= N i) (< (+ i 1) N)), 185482#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 185485#(or (< j M) (<= i (+ k 1))), 185499#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 185488#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 185492#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 185473#(or (< j M) (<= N (+ 2 k))), 185484#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< j M)), 185466#(< j M), 185480#(or (<= N i) (< (+ i 1) N) (< j M)), 185497#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 185468#(or (< j M) (< i N)), 185474#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 185500#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 185477#(or (< j M) (<= i (+ 2 k))), 185478#(or (< (+ j 1) M) (<= i (+ 2 k)) (<= M j)), 185491#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 185481#(or (<= N i) (< (+ i 1) N) (<= N k)), 185475#(or (<= N (+ k 1)) (< i N)), 185470#(or (<= N k) (< i N)), 185490#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 185476#(or (<= N (+ k 1)) (< j M) (< i N)), 185496#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 185489#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 185483#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 185486#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 185469#(or (< j M) (<= N k)), 185471#(or (< j M) (<= N k) (< i N)), 185467#(< i N), 185498#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 185493#(or (< j M) (<= i k))] [2022-03-15 22:21:48,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:21:48,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:21:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:21:48,821 INFO L87 Difference]: Start difference. First operand 5330 states and 25165 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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) [2022-03-15 22:21:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:54,370 INFO L93 Difference]: Finished difference Result 11679 states and 51505 transitions. [2022-03-15 22:21:54,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-03-15 22:21:54,370 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:21:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:54,401 INFO L225 Difference]: With dead ends: 11679 [2022-03-15 22:21:54,401 INFO L226 Difference]: Without dead ends: 11630 [2022-03-15 22:21:54,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17091 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=9714, Invalid=38906, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 22:21:54,404 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 612 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:54,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 0 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:21:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11630 states. [2022-03-15 22:21:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11630 to 5648. [2022-03-15 22:21:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5648 states, 5647 states have (on average 4.7651850540109795) internal successors, (26909), 5647 states have internal predecessors, (26909), 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) [2022-03-15 22:21:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 26909 transitions. [2022-03-15 22:21:54,617 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 26909 transitions. Word has length 18 [2022-03-15 22:21:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:54,617 INFO L470 AbstractCegarLoop]: Abstraction has 5648 states and 26909 transitions. [2022-03-15 22:21:54,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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) [2022-03-15 22:21:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 26909 transitions. [2022-03-15 22:21:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:54,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:54,632 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:54,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:54,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:54,847 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:54,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -836565544, now seen corresponding path program 21 times [2022-03-15 22:21:54,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:54,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735810782] [2022-03-15 22:21:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:54,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:54,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735810782] [2022-03-15 22:21:54,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735810782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:54,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192720302] [2022-03-15 22:21:54,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:54,929 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 22:21:54,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:21:54,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:54,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:55,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:55,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192720302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:55,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:55,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-03-15 22:21:55,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319688914] [2022-03-15 22:21:55,097 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:55,098 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:55,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:21:55,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:56,474 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [208954#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 208957#(or (<= (+ 2 k) N) (< j M)), 208962#(or (< (+ j 1) M) (<= k i) (<= M j)), 208949#(or (<= N i) (< (+ i 1) N) (< k N)), 208968#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 208969#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 208958#(or (< j M) (<= (+ k 1) i)), 208947#(or (<= N i) (< (+ i 1) N) (< j M)), 208975#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 208970#(or (< j M) (<= k (+ i 1))), 208952#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 208972#(or (< (+ 2 j) M) (<= k (+ i 1)) (<= M (+ j 1))), 208967#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 208976#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 208973#(or (< (+ i 4) N) (<= N (+ 3 i))), 208971#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 208955#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 208965#(or (<= k i) (< (+ 2 j) M) (<= M (+ j 1))), 208964#(or (<= (+ k 1) i) (< (+ 2 j) M) (<= M (+ j 1))), 208944#(< j M), 208956#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 208943#(< i N), 208963#(or (<= (+ 2 k) N) (< (+ 2 j) M) (<= M (+ j 1))), 208974#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 208950#(or (<= (+ k 1) N) (< j M)), 208959#(or (<= k i) (< j M)), 208946#(or (<= N i) (< (+ i 1) N)), 208960#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 208953#(or (<= N (+ i 1)) (< (+ 2 i) N)), 208945#(or (< j M) (< i N)), 208951#(or (< j M) (< k N) (< i N)), 208966#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 208948#(or (< k N) (< i N)), 208961#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j))] [2022-03-15 22:21:56,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:21:56,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:21:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2227, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:21:56,475 INFO L87 Difference]: Start difference. First operand 5648 states and 26909 transitions. Second operand has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 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) [2022-03-15 22:22:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:17,493 INFO L93 Difference]: Finished difference Result 14732 states and 58076 transitions. [2022-03-15 22:22:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2022-03-15 22:22:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:17,531 INFO L225 Difference]: With dead ends: 14732 [2022-03-15 22:22:17,531 INFO L226 Difference]: Without dead ends: 14729 [2022-03-15 22:22:17,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103099 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=31572, Invalid=214940, Unknown=0, NotChecked=0, Total=246512 [2022-03-15 22:22:17,540 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1432 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 1149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1149 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:17,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1432 Valid, 0 Invalid, 5396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1149 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 22:22:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14729 states. [2022-03-15 22:22:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14729 to 7016. [2022-03-15 22:22:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 7015 states have (on average 4.823093371347113) internal successors, (33834), 7015 states have internal predecessors, (33834), 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) [2022-03-15 22:22:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 33834 transitions. [2022-03-15 22:22:17,872 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 33834 transitions. Word has length 18 [2022-03-15 22:22:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:17,872 INFO L470 AbstractCegarLoop]: Abstraction has 7016 states and 33834 transitions. [2022-03-15 22:22:17,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 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) [2022-03-15 22:22:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 33834 transitions. [2022-03-15 22:22:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:17,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:17,893 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:17,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:18,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:18,107 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash -89639722, now seen corresponding path program 22 times [2022-03-15 22:22:18,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:18,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730682564] [2022-03-15 22:22:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:18,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:18,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730682564] [2022-03-15 22:22:18,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730682564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:18,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337621585] [2022-03-15 22:22:18,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:18,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:18,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:18,184 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:18,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 22:22:18,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:18,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:18,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:18,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:18,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:18,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337621585] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:18,390 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:18,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:22:18,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1964504563] [2022-03-15 22:22:18,390 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:18,392 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:18,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:22:18,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:19,676 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [238763#(or (<= N i) (< (+ i 1) N) (< j M)), 238761#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 238777#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 238756#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 238769#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 238771#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 238774#(or (< (+ j 1) M) (<= (+ i 1) k) (<= M j)), 238770#(or (< (+ j 1) M) (<= i k) (<= M j)), 238762#(or (< (+ 2 j) M) (<= i (+ k 1)) (<= M (+ j 1))), 238778#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 238776#(or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))), 238749#(< i N), 238766#(or (< j M) (<= i k)), 238750#(or (<= N i) (< (+ i 1) N)), 238759#(or (< j M) (<= N k) (< i N)), 238767#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 238755#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 238764#(or (<= N i) (< (+ i 1) N) (<= N k)), 238772#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 238765#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 238757#(or (<= N k) (< i N)), 238760#(or (< j M) (<= i (+ k 1))), 238752#(< j M), 238768#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 238753#(or (< j M) (<= N k)), 238773#(or (<= (+ i 1) k) (< j M)), 238775#(or (<= i k) (< (+ 2 j) M) (<= M (+ j 1))), 238758#(or (< j M) (< i N)), 238751#(or (<= N (+ i 1)) (< (+ 2 i) N)), 238754#(or (<= N (+ k 1)) (< j M))] [2022-03-15 22:22:19,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:22:19,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:22:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:19,677 INFO L87 Difference]: Start difference. First operand 7016 states and 33834 transitions. Second operand has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 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) [2022-03-15 22:22:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:28,921 INFO L93 Difference]: Finished difference Result 14370 states and 62029 transitions. [2022-03-15 22:22:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2022-03-15 22:22:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:28,958 INFO L225 Difference]: With dead ends: 14370 [2022-03-15 22:22:28,958 INFO L226 Difference]: Without dead ends: 14290 [2022-03-15 22:22:28,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32846 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=14561, Invalid=71581, Unknown=0, NotChecked=0, Total=86142 [2022-03-15 22:22:28,961 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 779 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:28,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 0 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:22:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14290 states. [2022-03-15 22:22:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14290 to 8712. [2022-03-15 22:22:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 8711 states have (on average 4.871197336700723) internal successors, (42433), 8711 states have internal predecessors, (42433), 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) [2022-03-15 22:22:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 42433 transitions. [2022-03-15 22:22:29,252 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 42433 transitions. Word has length 18 [2022-03-15 22:22:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:29,253 INFO L470 AbstractCegarLoop]: Abstraction has 8712 states and 42433 transitions. [2022-03-15 22:22:29,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 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) [2022-03-15 22:22:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 42433 transitions. [2022-03-15 22:22:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:29,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:29,274 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:29,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:29,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 22:22:29,497 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1692067640, now seen corresponding path program 23 times [2022-03-15 22:22:29,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:29,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088246497] [2022-03-15 22:22:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:29,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:29,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088246497] [2022-03-15 22:22:29,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088246497] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:29,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634180302] [2022-03-15 22:22:29,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:29,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:29,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:29,554 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 22:22:29,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:22:29,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:29,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:29,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:29,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634180302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:29,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:29,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-03-15 22:22:29,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154091724] [2022-03-15 22:22:29,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:29,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:29,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 188 transitions. [2022-03-15 22:22:29,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:31,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [271211#(or (<= (+ 3 i) N) (< j M)), 271207#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 271210#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 271215#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 271202#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 271199#(or (< j M) (< i N)), 271209#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 271201#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 271200#(or (< (+ j 1) M) (< i N) (<= M j)), 271212#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 271204#(or (<= N i) (< (+ i 1) N) (< j M)), 271198#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 271195#(< j M), 271213#(or (<= (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 271203#(or (<= N i) (<= (+ 2 i) N)), 271196#(or (< (+ j 1) M) (<= M j)), 271214#(or (<= (+ 3 i) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 271197#(or (< (+ 2 j) M) (<= M (+ j 1))), 271205#(or (< j M) (<= (+ 2 i) N)), 271216#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 271206#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 271208#(or (<= M (+ 2 j)) (< (+ 3 j) M) (<= (+ 2 i) N))] [2022-03-15 22:22:31,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:31,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:31,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:22:31,016 INFO L87 Difference]: Start difference. First operand 8712 states and 42433 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 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) [2022-03-15 22:22:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:32,544 INFO L93 Difference]: Finished difference Result 12809 states and 59985 transitions. [2022-03-15 22:22:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:22:32,545 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:32,579 INFO L225 Difference]: With dead ends: 12809 [2022-03-15 22:22:32,579 INFO L226 Difference]: Without dead ends: 12795 [2022-03-15 22:22:32,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1428, Invalid=6404, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:22:32,580 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:32,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12795 states. [2022-03-15 22:22:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12795 to 9578. [2022-03-15 22:22:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9578 states, 9577 states have (on average 4.865615537224601) internal successors, (46598), 9577 states have internal predecessors, (46598), 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) [2022-03-15 22:22:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 46598 transitions. [2022-03-15 22:22:32,810 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 46598 transitions. Word has length 18 [2022-03-15 22:22:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:32,810 INFO L470 AbstractCegarLoop]: Abstraction has 9578 states and 46598 transitions. [2022-03-15 22:22:32,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 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) [2022-03-15 22:22:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 46598 transitions. [2022-03-15 22:22:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:32,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:32,828 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:32,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:33,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:22:33,029 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1240855888, now seen corresponding path program 24 times [2022-03-15 22:22:33,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:33,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733715447] [2022-03-15 22:22:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:33,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:33,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733715447] [2022-03-15 22:22:33,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733715447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:33,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438543633] [2022-03-15 22:22:33,104 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:33,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:33,105 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:33,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 22:22:33,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:22:33,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:33,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:33,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:33,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:33,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438543633] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:33,365 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:33,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-03-15 22:22:33,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084055477] [2022-03-15 22:22:33,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:33,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:33,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 157 transitions. [2022-03-15 22:22:33,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:34,749 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [303407#(or (<= (+ j 1) M) (< i N)), 303416#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i))), 303432#(or (<= M j) (<= (+ k j 1) (+ M i))), 303429#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 303430#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 303421#(or (<= N i) (< (+ i 1) N) (< k N)), 303402#(< i N), 303427#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 303403#(or (<= N i) (< (+ i 1) N)), 303426#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 303408#(or (<= N i) (< (+ i 1) N) (< j M)), 303410#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 303423#(or (<= (+ k j 4) (+ N M)) (<= M j)), 303409#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 303436#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 303413#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 303424#(or (<= M j) (<= (+ 3 k j) (+ M i))), 303418#(or (< k N) (< i N)), 303414#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 303417#(< k N), 303422#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 303431#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 303420#(or (< j M) (< k N) (< i N)), 303404#(or (<= N (+ i 1)) (< (+ 2 i) N)), 303434#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 303415#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 303433#(or (<= (+ 2 k j) (+ N M)) (< i N)), 303406#(or (< (+ i 4) N) (<= N (+ 3 i))), 303412#(or (<= (+ 2 j) M) (< i N)), 303405#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 303428#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 303411#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 303425#(or (<= (+ 2 k j) (+ M i)) (<= M j)), 303419#(or (< k N) (<= (+ j 1) M)), 303435#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 303437#(or (< (+ i 4) N) (<= (+ 2 k j) (+ N M)) (<= N (+ 3 i)))] [2022-03-15 22:22:34,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:22:34,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:34,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:22:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3105, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:22:34,751 INFO L87 Difference]: Start difference. First operand 9578 states and 46598 transitions. Second operand has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 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) [2022-03-15 22:22:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:48,565 INFO L93 Difference]: Finished difference Result 18776 states and 78633 transitions. [2022-03-15 22:22:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 370 states. [2022-03-15 22:22:48,566 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:48,621 INFO L225 Difference]: With dead ends: 18776 [2022-03-15 22:22:48,621 INFO L226 Difference]: Without dead ends: 18760 [2022-03-15 22:22:48,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64508 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=26327, Invalid=140545, Unknown=0, NotChecked=0, Total=166872 [2022-03-15 22:22:48,627 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1294 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 2802 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:48,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 0 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2802 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:22:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18760 states. [2022-03-15 22:22:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18760 to 11130. [2022-03-15 22:22:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11130 states, 11129 states have (on average 4.8755503639140985) internal successors, (54260), 11129 states have internal predecessors, (54260), 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) [2022-03-15 22:22:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 54260 transitions. [2022-03-15 22:22:48,996 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 54260 transitions. Word has length 18 [2022-03-15 22:22:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:48,996 INFO L470 AbstractCegarLoop]: Abstraction has 11130 states and 54260 transitions. [2022-03-15 22:22:48,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 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) [2022-03-15 22:22:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 54260 transitions. [2022-03-15 22:22:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:49,017 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:49,018 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:49,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 22:22:49,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 22:22:49,218 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -909466934, now seen corresponding path program 25 times [2022-03-15 22:22:49,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:49,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030187472] [2022-03-15 22:22:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:49,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:49,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030187472] [2022-03-15 22:22:49,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030187472] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:49,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10255545] [2022-03-15 22:22:49,273 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:49,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:49,274 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:49,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 22:22:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:49,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:49,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:49,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:49,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10255545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:49,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:49,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-03-15 22:22:49,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348847565] [2022-03-15 22:22:49,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:49,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:49,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 146 transitions. [2022-03-15 22:22:49,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:50,519 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [345310#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 345301#(or (<= N i) (< (+ i 1) N) (< j M)), 345303#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 345305#(or (<= (+ M i) (+ 3 k j)) (<= M j)), 345312#(or (<= M j) (<= (+ M i) (+ k j 1))), 345315#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 345298#(< j M), 345316#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 345314#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 345300#(or (<= N i) (< (+ i 1) N)), 345297#(< i N), 345304#(or (<= (+ N M) (+ 3 k j)) (<= M j)), 345311#(or (<= (+ M i) (+ 2 k j)) (<= M j)), 345317#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 345302#(or (<= N (+ i 1)) (< (+ 2 i) N)), 345313#(or (<= (+ N M) (+ k j 1)) (< i N)), 345309#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 345306#(or (<= N k) (< i N)), 345299#(or (< j M) (< i N)), 345308#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 345307#(or (<= N i) (< (+ i 1) N) (<= N k))] [2022-03-15 22:22:50,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:50,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:50,520 INFO L87 Difference]: Start difference. First operand 11130 states and 54260 transitions. Second operand has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 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) [2022-03-15 22:22:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:57,166 INFO L93 Difference]: Finished difference Result 41413 states and 188526 transitions. [2022-03-15 22:22:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 22:22:57,166 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:57,320 INFO L225 Difference]: With dead ends: 41413 [2022-03-15 22:22:57,320 INFO L226 Difference]: Without dead ends: 41294 [2022-03-15 22:22:57,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22281 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=11589, Invalid=47217, Unknown=0, NotChecked=0, Total=58806 [2022-03-15 22:22:57,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:57,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:22:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41294 states. [2022-03-15 22:22:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41294 to 16830. [2022-03-15 22:22:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16830 states, 16829 states have (on average 4.947471626359261) internal successors, (83261), 16829 states have internal predecessors, (83261), 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) [2022-03-15 22:22:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16830 states to 16830 states and 83261 transitions. [2022-03-15 22:22:58,207 INFO L78 Accepts]: Start accepts. Automaton has 16830 states and 83261 transitions. Word has length 18 [2022-03-15 22:22:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:58,208 INFO L470 AbstractCegarLoop]: Abstraction has 16830 states and 83261 transitions. [2022-03-15 22:22:58,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 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) [2022-03-15 22:22:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16830 states and 83261 transitions. [2022-03-15 22:22:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:58,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:58,244 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:58,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 22:22:58,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 22:22:58,459 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1681062270, now seen corresponding path program 26 times [2022-03-15 22:22:58,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:58,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45414582] [2022-03-15 22:22:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:58,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:58,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45414582] [2022-03-15 22:22:58,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45414582] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:58,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079693717] [2022-03-15 22:22:58,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:58,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:58,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:58,526 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 22:22:58,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:58,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:58,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:58,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:58,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:58,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079693717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:58,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:58,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-03-15 22:22:58,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986211269] [2022-03-15 22:22:58,790 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:58,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:58,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 22:22:58,797 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:59,602 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [420915#(or (<= N i) (< (+ i 1) N)), 420916#(or (<= (+ N M) (+ 3 k j)) (<= M j)), 420934#(or (<= M j) (<= (+ M i) (+ k j 1))), 420931#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 420918#(or (< i N) (<= M j)), 420933#(or (<= (+ M i) (+ 2 k j)) (<= M j)), 420926#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 420914#(< i N), 420930#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 420919#(< k N), 420932#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 420923#(or (<= N (+ i 1)) (< (+ 2 i) N)), 420922#(or (<= N i) (< (+ i 1) N) (< k N)), 420927#(or (<= N i) (< (+ i 1) N) (<= M j)), 420925#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 420917#(or (<= (+ M i) (+ 3 k j)) (<= M j)), 420921#(or (<= (+ N M) (+ k j 1)) (< i N)), 420928#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 420929#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 420920#(or (< k N) (< i N)), 420924#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N))] [2022-03-15 22:22:59,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:59,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:59,604 INFO L87 Difference]: Start difference. First operand 16830 states and 83261 transitions. Second operand has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 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) [2022-03-15 22:23:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:04,171 INFO L93 Difference]: Finished difference Result 36604 states and 167411 transitions. [2022-03-15 22:23:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-03-15 22:23:04,171 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:04,321 INFO L225 Difference]: With dead ends: 36604 [2022-03-15 22:23:04,321 INFO L226 Difference]: Without dead ends: 36448 [2022-03-15 22:23:04,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14532 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=8015, Invalid=30991, Unknown=0, NotChecked=0, Total=39006 [2022-03-15 22:23:04,324 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:04,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:23:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36448 states. [2022-03-15 22:23:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36448 to 12819. [2022-03-15 22:23:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12819 states, 12818 states have (on average 4.795365891714776) internal successors, (61467), 12818 states have internal predecessors, (61467), 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) [2022-03-15 22:23:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12819 states to 12819 states and 61467 transitions. [2022-03-15 22:23:05,018 INFO L78 Accepts]: Start accepts. Automaton has 12819 states and 61467 transitions. Word has length 18 [2022-03-15 22:23:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:05,018 INFO L470 AbstractCegarLoop]: Abstraction has 12819 states and 61467 transitions. [2022-03-15 22:23:05,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 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) [2022-03-15 22:23:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12819 states and 61467 transitions. [2022-03-15 22:23:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:05,050 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:05,050 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:05,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:05,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 22:23:05,276 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1100756972, now seen corresponding path program 27 times [2022-03-15 22:23:05,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:05,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944999503] [2022-03-15 22:23:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:05,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:05,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944999503] [2022-03-15 22:23:05,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944999503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:05,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431967247] [2022-03-15 22:23:05,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:05,344 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:05,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 22:23:05,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:23:05,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:05,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:05,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:05,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:05,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431967247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:05,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:05,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15 [2022-03-15 22:23:05,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331681822] [2022-03-15 22:23:05,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:05,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:05,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:23:05,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:07,148 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [483629#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 483628#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 483618#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 483624#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 483621#(or (<= (+ 2 k) i) (< (+ j 1) M) (<= M j)), 483622#(or (<= N (+ i 1)) (< (+ 2 i) N)), 483604#(or (<= (+ k 1) N) (< j M)), 483635#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 483620#(or (<= (+ 2 k) i) (< j M)), 483643#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 483619#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 483634#(or (<= N i) (<= k (+ i 1))), 483627#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 483642#(or (< j M) (<= (+ k 1) i)), 483611#(or (<= (+ 2 k) N) (< j M) (< i N)), 483609#(or (<= (+ 2 k) N) (< i N)), 483638#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 483640#(or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 483613#(or (<= (+ 3 k) N) (< (+ j 1) M) (<= M j)), 483607#(or (< k N) (< i N)), 483630#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 483637#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 483639#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 483608#(or (< j M) (< k N) (< i N)), 483605#(< i N), 483615#(or (<= N i) (< (+ i 1) N) (< k N)), 483633#(or (< (+ i 4) N) (<= (+ 2 k) N) (<= N (+ 3 i))), 483641#(or (<= (+ k j) (+ M i 1)) (<= N i)), 483626#(or (< (+ i 4) N) (<= N (+ 3 i))), 483614#(or (<= N i) (< (+ i 1) N)), 483612#(or (<= (+ 3 k) N) (< j M)), 483623#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 483632#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 483631#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 483606#(or (< j M) (< i N)), 483610#(or (<= (+ 2 k) N) (< j M)), 483617#(or (<= N i) (< (+ i 1) N) (< j M)), 483616#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 483625#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 483603#(< j M), 483636#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M))] [2022-03-15 22:23:07,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 22:23:07,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 22:23:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2726, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:23:07,150 INFO L87 Difference]: Start difference. First operand 12819 states and 61467 transitions. Second operand has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 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) [2022-03-15 22:23:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:23,713 INFO L93 Difference]: Finished difference Result 22060 states and 93927 transitions. [2022-03-15 22:23:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 436 states. [2022-03-15 22:23:23,713 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:23,791 INFO L225 Difference]: With dead ends: 22060 [2022-03-15 22:23:23,792 INFO L226 Difference]: Without dead ends: 22060 [2022-03-15 22:23:23,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87771 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=34025, Invalid=177115, Unknown=0, NotChecked=0, Total=211140 [2022-03-15 22:23:23,801 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1397 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:23,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 0 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:23:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22060 states. [2022-03-15 22:23:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22060 to 13890. [2022-03-15 22:23:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13890 states, 13889 states have (on average 4.801929584563323) internal successors, (66694), 13889 states have internal predecessors, (66694), 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) [2022-03-15 22:23:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 66694 transitions. [2022-03-15 22:23:24,297 INFO L78 Accepts]: Start accepts. Automaton has 13890 states and 66694 transitions. Word has length 18 [2022-03-15 22:23:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:24,297 INFO L470 AbstractCegarLoop]: Abstraction has 13890 states and 66694 transitions. [2022-03-15 22:23:24,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 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) [2022-03-15 22:23:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 13890 states and 66694 transitions. [2022-03-15 22:23:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:24,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:24,326 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:24,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:24,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 22:23:24,527 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash 628801996, now seen corresponding path program 28 times [2022-03-15 22:23:24,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:24,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788701630] [2022-03-15 22:23:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:24,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:24,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788701630] [2022-03-15 22:23:24,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788701630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:24,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135788487] [2022-03-15 22:23:24,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:24,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:24,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:24,592 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 22:23:24,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:24,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:24,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:24,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:24,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:24,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135788487] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:24,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:24,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-03-15 22:23:24,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074873806] [2022-03-15 22:23:24,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:24,836 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:24,842 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 160 transitions. [2022-03-15 22:23:24,842 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:26,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [534424#(or (< j M) (< k N) (< i N)), 534417#(or (<= (+ 2 j) M) (< i N)), 534449#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= (+ 3 j) M)), 534434#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 534448#(or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N)), 534444#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i))), 534446#(or (<= N i) (< (+ i 1) N) (<= (+ 3 j) M)), 534455#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i)) (< k N)), 534435#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 534430#(or (<= N (+ i 1)) (< (+ 2 i) N)), 534443#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 534440#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 534454#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N)), 534453#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 534416#(or (<= (+ j 1) M) (< i N)), 534450#(or (<= (+ 3 k j) (+ N M)) (< i N)), 534432#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 534451#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N)), 534442#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 534426#(or (<= (+ 2 j) M) (< k N) (< i N)), 534419#(or (<= N i) (< (+ i 1) N) (< j M)), 534433#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 534439#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 534429#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N) (< k N)), 534423#(or (< k N) (< i N)), 534445#(or (<= (+ 3 j) M) (< i N)), 534447#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 j) M)), 534441#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 534437#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 534456#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 534427#(or (<= N i) (< (+ i 1) N) (< k N)), 534425#(or (<= (+ 2 j) M) (< k N)), 534452#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N)), 534428#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 534421#(< k N), 534438#(or (< (+ i 4) N) (<= N (+ 3 i))), 534418#(or (<= N i) (< (+ i 1) N)), 534420#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 534422#(or (< k N) (<= (+ j 1) M)), 534415#(< i N), 534436#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 534457#(or (<= (+ 3 k j) (+ N M)) (< (+ i 4) N) (<= N (+ 3 i))), 534431#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N))] [2022-03-15 22:23:26,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 22:23:26,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 22:23:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:23:26,341 INFO L87 Difference]: Start difference. First operand 13890 states and 66694 transitions. Second operand has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 states have internal predecessors, (136), 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) [2022-03-15 22:23:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:36,520 INFO L93 Difference]: Finished difference Result 17851 states and 81650 transitions. [2022-03-15 22:23:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 295 states. [2022-03-15 22:23:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:36,575 INFO L225 Difference]: With dead ends: 17851 [2022-03-15 22:23:36,576 INFO L226 Difference]: Without dead ends: 17840 [2022-03-15 22:23:36,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38769 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=19940, Invalid=88630, Unknown=0, NotChecked=0, Total=108570 [2022-03-15 22:23:36,582 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 772 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:36,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 0 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:23:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2022-03-15 22:23:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 14528. [2022-03-15 22:23:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14528 states, 14527 states have (on average 4.829214565980588) internal successors, (70154), 14527 states have internal predecessors, (70154), 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) [2022-03-15 22:23:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14528 states to 14528 states and 70154 transitions. [2022-03-15 22:23:36,981 INFO L78 Accepts]: Start accepts. Automaton has 14528 states and 70154 transitions. Word has length 18 [2022-03-15 22:23:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:36,981 INFO L470 AbstractCegarLoop]: Abstraction has 14528 states and 70154 transitions. [2022-03-15 22:23:36,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 states have internal predecessors, (136), 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) [2022-03-15 22:23:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14528 states and 70154 transitions. [2022-03-15 22:23:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:37,013 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:37,013 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:37,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:37,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 22:23:37,214 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1598821612, now seen corresponding path program 29 times [2022-03-15 22:23:37,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:37,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033426419] [2022-03-15 22:23:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:37,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:37,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033426419] [2022-03-15 22:23:37,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033426419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:37,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051222070] [2022-03-15 22:23:37,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:37,264 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:37,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 22:23:37,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:23:37,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:37,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:37,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:37,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:37,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051222070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:37,488 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:37,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 22:23:37,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [275954465] [2022-03-15 22:23:37,488 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:37,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:37,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 151 transitions. [2022-03-15 22:23:37,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:38,508 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [582038#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 582032#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 582022#(or (< j M) (< i N)), 582036#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 582041#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 582042#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 582018#(< i N), 582017#(< j M), 582033#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 582029#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 582023#(or (<= N i) (< (+ i 1) N) (< j M)), 582037#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 582026#(or (<= N k) (< i N)), 582019#(or (<= N i) (< (+ i 1) N)), 582040#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 582031#(or (< j M) (<= N k) (< i N)), 582028#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 582021#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 582025#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 582034#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 582030#(or (< j M) (<= N k)), 582035#(or (<= N (+ k 1)) (< i N)), 582027#(or (<= N i) (< (+ i 1) N) (<= N k)), 582020#(or (<= N (+ i 1)) (< (+ 2 i) N)), 582039#(or (< i N) (<= (+ N M) (+ 2 k j))), 582024#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:23:38,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:23:38,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:23:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:23:38,509 INFO L87 Difference]: Start difference. First operand 14528 states and 70154 transitions. Second operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 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) [2022-03-15 22:23:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:43,248 INFO L93 Difference]: Finished difference Result 35355 states and 159475 transitions. [2022-03-15 22:23:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 22:23:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:43,380 INFO L225 Difference]: With dead ends: 35355 [2022-03-15 22:23:43,380 INFO L226 Difference]: Without dead ends: 35349 [2022-03-15 22:23:43,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11256 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7410, Invalid=24810, Unknown=0, NotChecked=0, Total=32220 [2022-03-15 22:23:43,384 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 478 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:43,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 0 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:23:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35349 states. [2022-03-15 22:23:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35349 to 15201. [2022-03-15 22:23:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15201 states, 15200 states have (on average 4.834013157894737) internal successors, (73477), 15200 states have internal predecessors, (73477), 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) [2022-03-15 22:23:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15201 states to 15201 states and 73477 transitions. [2022-03-15 22:23:44,057 INFO L78 Accepts]: Start accepts. Automaton has 15201 states and 73477 transitions. Word has length 18 [2022-03-15 22:23:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:44,057 INFO L470 AbstractCegarLoop]: Abstraction has 15201 states and 73477 transitions. [2022-03-15 22:23:44,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 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) [2022-03-15 22:23:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15201 states and 73477 transitions. [2022-03-15 22:23:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:44,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:44,102 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:44,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 22:23:44,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 22:23:44,311 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -687040614, now seen corresponding path program 30 times [2022-03-15 22:23:44,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:44,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354975304] [2022-03-15 22:23:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:44,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:44,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354975304] [2022-03-15 22:23:44,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354975304] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:44,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129698687] [2022-03-15 22:23:44,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:44,380 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:44,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 22:23:44,418 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:44,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:44,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:44,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:44,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:44,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129698687] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:44,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:44,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:23:44,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079512797] [2022-03-15 22:23:44,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:44,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:44,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 132 transitions. [2022-03-15 22:23:44,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:45,427 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [648196#(or (<= N k) (< i N)), 648199#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 648203#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 648191#(or (<= N i) (< (+ i 1) N)), 648202#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 648193#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 648204#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 648201#(or (<= N i) (< (+ i 1) N) (<= N k)), 648205#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 648194#(< j M), 648197#(or (<= (+ N M) (+ k j 1)) (< i N)), 648210#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 648190#(< i N), 648195#(or (< j M) (< i N)), 648209#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 648192#(or (<= N (+ i 1)) (< (+ 2 i) N)), 648206#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 648200#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 648198#(or (<= N i) (< (+ i 1) N) (< j M)), 648207#(or (< i N) (<= (+ N M) (+ 2 k j))), 648208#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j)))] [2022-03-15 22:23:45,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:23:45,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:23:45,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:23:45,428 INFO L87 Difference]: Start difference. First operand 15201 states and 73477 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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) [2022-03-15 22:23:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:50,178 INFO L93 Difference]: Finished difference Result 36445 states and 163492 transitions. [2022-03-15 22:23:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 22:23:50,178 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:50,337 INFO L225 Difference]: With dead ends: 36445 [2022-03-15 22:23:50,337 INFO L226 Difference]: Without dead ends: 36442 [2022-03-15 22:23:50,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10873 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6649, Invalid=24151, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 22:23:50,339 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 400 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:50,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 0 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:23:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36442 states. [2022-03-15 22:23:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36442 to 15203. [2022-03-15 22:23:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15203 states, 15202 states have (on average 4.8358110774898035) internal successors, (73514), 15202 states have internal predecessors, (73514), 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) [2022-03-15 22:23:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15203 states to 15203 states and 73514 transitions. [2022-03-15 22:23:51,190 INFO L78 Accepts]: Start accepts. Automaton has 15203 states and 73514 transitions. Word has length 18 [2022-03-15 22:23:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:51,190 INFO L470 AbstractCegarLoop]: Abstraction has 15203 states and 73514 transitions. [2022-03-15 22:23:51,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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) [2022-03-15 22:23:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15203 states and 73514 transitions. [2022-03-15 22:23:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:51,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:51,230 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:51,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:51,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:51,430 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1458635950, now seen corresponding path program 31 times [2022-03-15 22:23:51,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:51,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832463293] [2022-03-15 22:23:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:51,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:51,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832463293] [2022-03-15 22:23:51,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832463293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:51,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480738812] [2022-03-15 22:23:51,484 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:51,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:51,486 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:51,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 22:23:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:51,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:51,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:51,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:51,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480738812] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:51,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:51,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:23:51,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495847205] [2022-03-15 22:23:51,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:51,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:51,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 22:23:51,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:52,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [715451#(or (<= N i) (< (+ i 1) N)), 715464#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 715454#(or (<= N i) (< (+ i 1) N) (<= M j)), 715463#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 715467#(or (< i N) (<= (+ N M) (+ 2 k j))), 715468#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 715469#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 715452#(or (<= N (+ i 1)) (< (+ 2 i) N)), 715450#(< i N), 715461#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 715470#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 715465#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 715466#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 715459#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 715455#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 715462#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 715456#(< k N), 715453#(or (< i N) (<= M j)), 715458#(or (<= N i) (< (+ i 1) N) (< k N)), 715460#(or (<= (+ N M) (+ k j 1)) (< i N)), 715457#(or (< k N) (< i N))] [2022-03-15 22:23:52,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:23:52,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:52,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:23:52,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1738, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:23:52,616 INFO L87 Difference]: Start difference. First operand 15203 states and 73514 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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) [2022-03-15 22:23:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:58,879 INFO L93 Difference]: Finished difference Result 36386 states and 163788 transitions. [2022-03-15 22:23:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 22:23:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:59,102 INFO L225 Difference]: With dead ends: 36386 [2022-03-15 22:23:59,102 INFO L226 Difference]: Without dead ends: 36378 [2022-03-15 22:23:59,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24362 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=11293, Invalid=48487, Unknown=0, NotChecked=0, Total=59780 [2022-03-15 22:23:59,105 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 610 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:59,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [610 Valid, 0 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:23:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36378 states. [2022-03-15 22:23:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36378 to 15245. [2022-03-15 22:23:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15245 states, 15244 states have (on average 4.83862503279979) internal successors, (73760), 15244 states have internal predecessors, (73760), 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) [2022-03-15 22:23:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15245 states to 15245 states and 73760 transitions. [2022-03-15 22:23:59,683 INFO L78 Accepts]: Start accepts. Automaton has 15245 states and 73760 transitions. Word has length 18 [2022-03-15 22:23:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:59,684 INFO L470 AbstractCegarLoop]: Abstraction has 15245 states and 73760 transitions. [2022-03-15 22:23:59,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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) [2022-03-15 22:23:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15245 states and 73760 transitions. [2022-03-15 22:23:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:59,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:59,820 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:59,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:00,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:00,063 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 243652314, now seen corresponding path program 32 times [2022-03-15 22:24:00,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:00,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864000265] [2022-03-15 22:24:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:00,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:00,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864000265] [2022-03-15 22:24:00,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864000265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:00,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748173529] [2022-03-15 22:24:00,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:24:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:00,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:00,147 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:00,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 22:24:00,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:24:00,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:00,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:24:00,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:00,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:00,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748173529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:00,381 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:00,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 22:24:00,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918437073] [2022-03-15 22:24:00,381 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:00,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:00,388 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 147 transitions. [2022-03-15 22:24:00,388 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:01,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [782892#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 782893#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 782878#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 782880#(< k N), 782896#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 782885#(or (< k N) (< i N) (<= M j)), 782875#(or (<= N i) (< (+ i 1) N) (<= M j)), 782887#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= M j)), 782874#(or (< i N) (<= M j)), 782884#(or (< k N) (<= M j)), 782873#(or (<= N (+ i 1)) (< (+ 2 i) N)), 782879#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 782886#(or (<= N i) (< (+ i 1) N) (< k N) (<= M j)), 782883#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 782889#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 782888#(or (< i N) (<= (+ N M) (+ 2 k j))), 782871#(< i N), 782890#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 782872#(or (<= N i) (< (+ i 1) N)), 782891#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 782894#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (<= M j)), 782881#(or (< k N) (< i N)), 782877#(or (<= M (+ j 1)) (< i N)), 782876#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 782895#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M (+ j 1))), 782882#(or (<= N i) (< (+ i 1) N) (< k N))] [2022-03-15 22:24:01,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:24:01,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:24:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2005, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:24:01,410 INFO L87 Difference]: Start difference. First operand 15245 states and 73760 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 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) [2022-03-15 22:24:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:07,507 INFO L93 Difference]: Finished difference Result 35006 states and 158822 transitions. [2022-03-15 22:24:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 22:24:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:24:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:07,722 INFO L225 Difference]: With dead ends: 35006 [2022-03-15 22:24:07,722 INFO L226 Difference]: Without dead ends: 34920 [2022-03-15 22:24:07,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22198 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=11547, Invalid=44385, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 22:24:07,724 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 617 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:07,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 0 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:24:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34920 states. [2022-03-15 22:24:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34920 to 15486. [2022-03-15 22:24:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15486 states, 15485 states have (on average 4.83680981595092) internal successors, (74898), 15485 states have internal predecessors, (74898), 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) [2022-03-15 22:24:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 74898 transitions. [2022-03-15 22:24:08,316 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 74898 transitions. Word has length 18 [2022-03-15 22:24:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:08,316 INFO L470 AbstractCegarLoop]: Abstraction has 15486 states and 74898 transitions. [2022-03-15 22:24:08,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 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) [2022-03-15 22:24:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 74898 transitions. [2022-03-15 22:24:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:24:08,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:08,348 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:08,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:08,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 22:24:08,549 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1406890632, now seen corresponding path program 33 times [2022-03-15 22:24:08,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:08,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420065148] [2022-03-15 22:24:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:08,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:08,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420065148] [2022-03-15 22:24:08,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420065148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:08,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024347506] [2022-03-15 22:24:08,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:24:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:08,601 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:08,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 22:24:08,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:24:08,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:08,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:24:08,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:24:08,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:24:08,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024347506] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:08,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:08,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-03-15 22:24:08,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012300779] [2022-03-15 22:24:08,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:08,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:08,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 164 transitions. [2022-03-15 22:24:08,767 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:09,708 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [849377#(or (< (+ 2 j) M) (<= M (+ j 1))), 849379#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 849384#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 849385#(or (<= (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 849373#(or (< j M) (< i N)), 849376#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 849375#(or (< j M) (<= (+ 2 i) N)), 849378#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 849380#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 849382#(or (<= M (+ 2 j)) (< (+ 3 j) M) (<= (+ 2 i) N)), 849371#(< j M), 849383#(or (<= (+ 3 i) N) (< j M)), 849381#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 849372#(or (< (+ j 1) M) (<= M j)), 849386#(or (<= (+ 3 i) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 849374#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:24:09,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:24:09,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:09,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:24:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:24:09,709 INFO L87 Difference]: Start difference. First operand 15486 states and 74898 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 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) [2022-03-15 22:24:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:10,792 INFO L93 Difference]: Finished difference Result 27451 states and 130378 transitions. [2022-03-15 22:24:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:24:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:24:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:10,887 INFO L225 Difference]: With dead ends: 27451 [2022-03-15 22:24:10,887 INFO L226 Difference]: Without dead ends: 27418 [2022-03-15 22:24:10,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=978, Invalid=2804, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:24:10,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:10,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:24:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27418 states. [2022-03-15 22:24:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27418 to 17637. [2022-03-15 22:24:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17637 states, 17636 states have (on average 4.866919936493536) internal successors, (85833), 17636 states have internal predecessors, (85833), 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) [2022-03-15 22:24:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17637 states to 17637 states and 85833 transitions. [2022-03-15 22:24:11,568 INFO L78 Accepts]: Start accepts. Automaton has 17637 states and 85833 transitions. Word has length 18 [2022-03-15 22:24:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:11,568 INFO L470 AbstractCegarLoop]: Abstraction has 17637 states and 85833 transitions. [2022-03-15 22:24:11,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 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) [2022-03-15 22:24:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17637 states and 85833 transitions. [2022-03-15 22:24:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:11,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:11,607 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:11,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:24:11,808 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -982311390, now seen corresponding path program 12 times [2022-03-15 22:24:11,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:11,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562669758] [2022-03-15 22:24:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:12,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:12,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562669758] [2022-03-15 22:24:12,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562669758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:12,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431486469] [2022-03-15 22:24:12,132 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:24:12,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:12,133 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:12,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 22:24:12,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:24:12,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:12,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:24:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:12,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-03-15 22:24:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:12,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:12,839 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 22:24:12,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 41 treesize of output 166 [2022-03-15 22:24:13,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:13,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:13,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 5 [2022-03-15 22:24:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:13,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431486469] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:13,269 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:13,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2022-03-15 22:24:13,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514736370] [2022-03-15 22:24:13,269 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:13,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:13,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 238 transitions. [2022-03-15 22:24:13,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:20,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [912325#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 912311#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 912339#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N))), 912343#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 912347#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 912316#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 912326#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 912321#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 912324#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912342#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 912354#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 912318#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 912360#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912368#(and (or (< (+ i 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))) (< j M) (not (< (+ 3 i) N)) (<= (+ k 4) N)) (or (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ k 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)))), 912330#(and (or (< (+ 3 k) N) (< i N) (<= (+ (select A (+ k 1)) sum2 (select A k) (select A (+ (- 1) N))) sum1)) (or (< (+ 3 k) N) (< i N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k) (select A (+ (- 1) N))))) (or (<= (+ 3 k) N) (< i N))), 912332#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N))), 912356#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 912319#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912357#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 912362#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912358#(and (or (<= (+ (select A (+ (- 1) i)) (select A k) (select A (+ (- 2) i))) sum1) (< j M) (< 3 i)) (or (<= sum1 (+ (select A (+ (- 1) i)) (select A k) (select A (+ (- 2) i)))) (< j M) (< 3 i)) (or (= sum2 0) (< j M) (< 3 i)) (or (< j M) (= k 0)) (or (<= 3 i) (< j M))), 912359#(and (or (< 2 i) (< j M) (<= (+ (select A (+ (- 1) i)) (select A k)) sum1)) (or (< 2 i) (<= sum1 (+ (select A (+ (- 1) i)) (select A k))) (< j M)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (<= 2 i) (< j M))), 912333#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912320#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912327#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 912322#(and (or (< (+ i 4) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 912366#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912315#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 912355#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 912351#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 912336#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 912341#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 912348#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 912353#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 912345#(and (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N) (< i N)) (or (<= (+ 3 k) N) (< j M) (< i N)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N) (< i N))), 912344#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 912317#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 912361#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912363#(and (or (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 912338#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 912313#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 912367#(and (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912310#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 912365#(and (or (< (+ i 4) N) (< j M) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 912335#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 912337#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 912369#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 912312#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 912350#(and (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (not (< i N))) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ k 4) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (< (+ i 1) N) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1)) (not (< i N)) (<= (+ k 4) N))), 912352#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912334#(and (or (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ k 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))) (not (< (+ 3 i) N)) (<= (+ k 4) N))), 912329#(and (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N)))), 912349#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 912364#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= 1 i)) (or (< j M) (= k 0)) (or (< j M) (<= sum1 (select A k)))), 912340#(and (or (< 4 N) (< j M) (<= sum1 (+ (select A (+ (- 2) N)) (select A k) (select A (+ N (- 3))) (select A (+ (- 1) N))))) (or (< j M) (= k 0)) (or (< 4 N) (< j M) (<= (+ (select A (+ (- 2) N)) (select A k) (select A (+ N (- 3))) (select A (+ (- 1) N))) sum1)) (or (= sum2 0) (< 4 N) (< j M)) (or (< j M) (<= 4 N))), 912314#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 912346#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 912328#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 912331#(and (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1)) (not (< i N)) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ k 4) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))))), 912323#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)))] [2022-03-15 22:24:20,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 22:24:20,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 22:24:20,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=7105, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 22:24:20,712 INFO L87 Difference]: Start difference. First operand 17637 states and 85833 transitions. Second operand has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 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) [2022-03-15 22:25:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:07,698 INFO L93 Difference]: Finished difference Result 19976 states and 94219 transitions. [2022-03-15 22:25:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2022-03-15 22:25:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 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 19 [2022-03-15 22:25:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:07,757 INFO L225 Difference]: With dead ends: 19976 [2022-03-15 22:25:07,757 INFO L226 Difference]: Without dead ends: 19916 [2022-03-15 22:25:07,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54918 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=18548, Invalid=120954, Unknown=0, NotChecked=0, Total=139502 [2022-03-15 22:25:07,763 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1322 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 3913 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 3913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:07,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1322 Valid, 0 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 3913 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:25:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2022-03-15 22:25:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 17825. [2022-03-15 22:25:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17824 states have (on average 4.8598518850987436) internal successors, (86622), 17824 states have internal predecessors, (86622), 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) [2022-03-15 22:25:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 86622 transitions. [2022-03-15 22:25:08,177 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 86622 transitions. Word has length 19 [2022-03-15 22:25:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:08,177 INFO L470 AbstractCegarLoop]: Abstraction has 17825 states and 86622 transitions. [2022-03-15 22:25:08,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 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) [2022-03-15 22:25:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 86622 transitions. [2022-03-15 22:25:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:08,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:08,213 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:08,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:08,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 22:25:08,414 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 373167012, now seen corresponding path program 13 times [2022-03-15 22:25:08,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:08,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628122514] [2022-03-15 22:25:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:08,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:08,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628122514] [2022-03-15 22:25:08,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628122514] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:08,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871737819] [2022-03-15 22:25:08,484 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:25:08,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:08,485 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:08,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 22:25:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:08,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:25:08,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:25:08,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:25:08,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871737819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:08,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:08,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-03-15 22:25:08,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075635465] [2022-03-15 22:25:08,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:08,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:08,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 22:25:08,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:10,738 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [968721#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 968728#(or (< j M) (<= N (+ 3 i))), 968700#(or (<= N i) (< k N)), 968709#(or (<= N (+ i 1)) (< k N)), 968730#(or (< j M) (<= k (+ 2 i))), 968708#(or (< j M) (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968725#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ k 1) N)), 968735#(or (< j M) (<= k (+ i 1))), 968715#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 968732#(or (<= N (+ i 1)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968690#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 968724#(or (<= N (+ 2 i)) (< j M) (< k N)), 968731#(or (<= N (+ i 1)) (<= N (+ 2 k)) (< (+ 3 k) N)), 968714#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 968734#(or (<= N (+ 2 i)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968729#(or (<= k (+ 3 i)) (< j M)), 968689#(or (<= N (+ k 1)) (< (+ 2 k) N)), 968716#(or (<= N (+ i 1)) (< j M)), 968699#(or (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968695#(or (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968711#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 968712#(or (<= N i) (< j M)), 968701#(or (<= N i) (<= N k) (< (+ k 1) N)), 968723#(or (<= N (+ 2 i)) (< j M)), 968698#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 968705#(or (< j M) (<= (+ N 1) i) (< k N)), 968697#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 968733#(or (<= N (+ 2 i)) (<= N (+ 2 k)) (< (+ 3 k) N)), 968710#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 968706#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 968693#(or (< j M) (<= N k) (< (+ k 1) N)), 968720#(or (<= N (+ 2 i)) (< k N)), 968707#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 968717#(or (<= N (+ i 1)) (< j M) (< k N)), 968694#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 968702#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 968722#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N)), 968719#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 968718#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 968691#(< j M), 968692#(or (< j M) (< k N)), 968688#(or (<= N k) (< (+ k 1) N)), 968696#(or (<= (+ N 1) i) (< k N)), 968704#(or (< j M) (<= (+ N 1) i)), 968736#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 968703#(or (<= N i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968687#(< k N), 968713#(or (<= N i) (< j M) (< k N)), 968726#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 2 k) N)), 968727#(or (<= N i) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 22:25:10,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 22:25:10,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 22:25:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=3603, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:25:10,739 INFO L87 Difference]: Start difference. First operand 17825 states and 86622 transitions. Second operand has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 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) [2022-03-15 22:25:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:16,348 INFO L93 Difference]: Finished difference Result 20078 states and 95596 transitions. [2022-03-15 22:25:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-03-15 22:25:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 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 19 [2022-03-15 22:25:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:16,410 INFO L225 Difference]: With dead ends: 20078 [2022-03-15 22:25:16,411 INFO L226 Difference]: Without dead ends: 20048 [2022-03-15 22:25:16,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12001 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8138, Invalid=32062, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:25:16,415 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 709 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:16,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 0 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:25:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20048 states. [2022-03-15 22:25:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20048 to 18146. [2022-03-15 22:25:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18146 states, 18145 states have (on average 4.854670708184073) internal successors, (88088), 18145 states have internal predecessors, (88088), 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) [2022-03-15 22:25:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18146 states to 18146 states and 88088 transitions. [2022-03-15 22:25:16,886 INFO L78 Accepts]: Start accepts. Automaton has 18146 states and 88088 transitions. Word has length 19 [2022-03-15 22:25:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:16,887 INFO L470 AbstractCegarLoop]: Abstraction has 18146 states and 88088 transitions. [2022-03-15 22:25:16,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 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) [2022-03-15 22:25:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 18146 states and 88088 transitions. [2022-03-15 22:25:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:16,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:16,926 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:16,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:17,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:17,127 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash -980181330, now seen corresponding path program 34 times [2022-03-15 22:25:17,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:17,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769793862] [2022-03-15 22:25:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:17,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:17,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769793862] [2022-03-15 22:25:17,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769793862] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:17,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623097833] [2022-03-15 22:25:17,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:25:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:17,367 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:17,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 22:25:17,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:25:17,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:17,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:25:17,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:17,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:17,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:17,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-03-15 22:25:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:17,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:18,131 INFO L353 Elim1Store]: treesize reduction 114, result has 61.4 percent of original size [2022-03-15 22:25:18,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 39 treesize of output 194 [2022-03-15 22:25:24,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:24,600 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:25:24,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 99 [2022-03-15 22:25:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:24,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623097833] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:24,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:24,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 22:25:24,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395891348] [2022-03-15 22:25:24,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:24,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:24,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 22:25:24,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:32,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [1025529#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1025534#(and (or (< (+ i 4) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 1025562#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025565#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1025543#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 1025542#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1025564#(and (or (< (+ j 1) M) (<= k i) (not (< j M))) (or (< (+ j 1) M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (< j M)) (<= sum1 (+ (select A j) sum2))) (or (< (+ j 1) M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (< j M)) (<= (+ (select A j) sum2) sum1))), 1025527#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 1025532#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025559#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025540#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 1025551#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1025556#(and (or (< (+ j 1) M) (not (< j M)) (< (+ 2 k) i) (<= sum1 (+ (select A j) (select A (+ (- 1) i)) sum2 (select A k)))) (or (< (+ j 1) M) (<= (+ (select A j) (select A (+ (- 1) i)) sum2 (select A k)) sum1) (not (< j M)) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< (+ j 1) M) (not (< j M)))), 1025563#(and (or (<= sum1 sum2) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0))) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= sum2 sum1)) (or (<= k i) (< j M))), 1025547#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 1025526#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 1025569#(and (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025552#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N))), 1025533#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1025567#(and (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N)))), 1025568#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025535#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025538#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 1025545#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 1025549#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 1025560#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025518#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 1025537#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 1025546#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 1025554#(and (or (<= (+ 2 k) i) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) i) (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= (+ k 1) i))), 1025548#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 1025561#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025536#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 1025541#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 1025530#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025558#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 1025522#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 1025555#(and (or (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (not (< j M)) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< j M)) (<= (+ k 4) N))), 1025531#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025553#(and (or (< j M) (<= (+ (select A (+ (- 1) i)) sum2 (select A k)) sum1) (< (+ 2 k) i)) (or (<= sum1 (+ (select A (+ (- 1) i)) sum2 (select A k))) (< j M) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< j M))), 1025566#(and (or (< (+ i 4) N) (< j M) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 1025519#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 1025524#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 1025523#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 1025544#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 1025550#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1025539#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 1025528#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1025521#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 1025557#(and (or (<= (+ 2 k) i) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (<= (+ 2 k) i) (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)))), 1025520#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 1025525#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N)))] [2022-03-15 22:25:32,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 22:25:32,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:32,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 22:25:32,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=6133, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 22:25:32,407 INFO L87 Difference]: Start difference. First operand 18146 states and 88088 transitions. Second operand has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 states have internal predecessors, (177), 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) [2022-03-15 22:27:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:13,456 INFO L93 Difference]: Finished difference Result 26782 states and 115059 transitions. [2022-03-15 22:27:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 536 states. [2022-03-15 22:27:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 states have internal predecessors, (177), 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 19 [2022-03-15 22:27:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:13,539 INFO L225 Difference]: With dead ends: 26782 [2022-03-15 22:27:13,539 INFO L226 Difference]: Without dead ends: 26556 [2022-03-15 22:27:13,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 40 SyntacticMatches, 16 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141821 ImplicationChecksByTransitivity, 98.7s TimeCoverageRelationStatistics Valid=43154, Invalid=304356, Unknown=0, NotChecked=0, Total=347510 [2022-03-15 22:27:13,554 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1811 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 6560 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1811 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 6560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:13,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1811 Valid, 0 Invalid, 7013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 6560 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 22:27:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2022-03-15 22:27:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 18554. [2022-03-15 22:27:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18554 states, 18553 states have (on average 4.848488115129629) internal successors, (89954), 18553 states have internal predecessors, (89954), 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) [2022-03-15 22:27:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18554 states to 18554 states and 89954 transitions. [2022-03-15 22:27:14,237 INFO L78 Accepts]: Start accepts. Automaton has 18554 states and 89954 transitions. Word has length 19 [2022-03-15 22:27:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:14,238 INFO L470 AbstractCegarLoop]: Abstraction has 18554 states and 89954 transitions. [2022-03-15 22:27:14,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 states have internal predecessors, (177), 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) [2022-03-15 22:27:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18554 states and 89954 transitions. [2022-03-15 22:27:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:27:14,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:14,277 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:14,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 22:27:14,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 22:27:14,478 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:27:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -163838756, now seen corresponding path program 35 times [2022-03-15 22:27:14,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:14,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627530248] [2022-03-15 22:27:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:14,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:14,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627530248] [2022-03-15 22:27:14,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627530248] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:14,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189525502] [2022-03-15 22:27:14,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:27:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:14,700 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:27:14,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 22:27:14,727 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:27:14,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:14,727 WARN L261 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 22:27:14,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:15,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:15,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:15,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:15,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:15,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:15,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-03-15 22:27:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:15,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:15,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:15,447 INFO L353 Elim1Store]: treesize reduction 96, result has 66.3 percent of original size [2022-03-15 22:27:15,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 39 treesize of output 202 [2022-03-15 22:27:24,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:24,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:27:24,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 99 [2022-03-15 22:27:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:24,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189525502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:24,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:24,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 22:27:24,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221642111] [2022-03-15 22:27:24,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:24,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:24,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 228 transitions. [2022-03-15 22:27:24,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:30,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [1090615#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090623#(and (or (< j M) (<= N k) (<= sum1 (+ sum2 (select A k)))) (or (< (+ sum2 (select A k)) (+ sum1 1)) (< j M) (<= N k))), 1090619#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 1090634#(and (or (< j M) (<= (+ 2 i) k) (<= (+ (select A i) sum1) sum2)) (or (< j M) (<= (+ 2 i) k) (<= sum2 (+ (select A i) sum1))) (or (<= (+ i 1) k) (< j M))), 1090629#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N)) (or (< j M) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090641#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1090645#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1)) (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (< i (+ k 1)))), 1090621#(and (or (<= N k) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= N k) (<= (+ sum2 (select A k)) sum1) (< i N))), 1090617#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 1090633#(and (or (<= sum1 sum2) (<= (+ i 1) k) (< j M)) (or (<= (+ i 1) k) (< j M) (<= sum2 sum1)) (or (< j M) (< i (+ k 1)))), 1090639#(and (or (< (+ j 1) M) (not (< j M)) (<= i k) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (not (< j M)) (<= i (+ k 1))) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)) (<= i k))), 1090632#(and (or (< j M) (<= i k) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k))) (<= i k)) (or (< j M) (<= i (+ k 1)))), 1090625#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (< j M) (not (< i N)) (<= N k)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1090636#(and (or (< (+ j 1) M) (not (< j M)) (<= i (+ 2 k))) (or (< i (+ 2 k)) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< i (+ 2 k)) (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) sum2 (select A k)) sum1) (not (< j M)))), 1090642#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1090624#(and (or (< j M) (<= N k) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (< j M) (<= N k) (<= (+ sum2 (select A k)) sum1) (< i N))), 1090637#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= N (+ 2 k))) (or (<= N (+ k 1)) (not (< (+ j 1) M)) (< (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)) (+ sum1 1)) (< (+ 2 j) M)) (or (<= N (+ k 1)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k))))), 1090613#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 1090628#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1090640#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (<= i k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= i k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= i (+ k 1)))), 1090635#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< (+ (select A j) (select A (+ k 1)) sum2 (select A k)) (+ sum1 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= N (+ 2 k)))), 1090643#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (<= (+ (select A j) sum2) sum1)) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (<= sum1 (+ (select A j) sum2)))), 1090627#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090630#(and (or (< j M) (<= N (+ 2 k))) (or (<= N (+ k 1)) (< j M) (< (+ (select A (+ k 1)) sum2 (select A k)) (+ sum1 1))) (or (<= N (+ k 1)) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 1090622#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (not (< i N)) (<= N k)) (or (< (+ i 1) N) (not (< i N)) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1090648#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (< j M) (<= N k) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= N k) (not (< (+ 3 i) N)) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)))), 1090644#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ j 1) M) (<= (+ 2 i) k) (not (< j M))) (or (< (+ j 1) M) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (<= (+ 2 i) k) (not (< j M))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 1090612#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 1090631#(and (or (< i (+ 2 k)) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M)) (or (< i (+ 2 k)) (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (< j M)) (or (< j M) (<= i (+ 2 k)))), 1090647#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= N k) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= N k) (not (< (+ 3 i) N)) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)))), 1090614#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 1090620#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1090618#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1090616#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 1090646#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (<= (+ 2 i) k) (< (+ 2 j) M)) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (not (< (+ j 1) M)) (<= (+ 2 i) k) (< (+ 2 j) M))), 1090626#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N k) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 1090638#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= i (+ 2 k))) (or (< i (+ 2 k)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)) sum1)) (or (< i (+ 2 k)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)))))] [2022-03-15 22:27:30,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 22:27:30,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 22:27:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=4012, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:27:30,497 INFO L87 Difference]: Start difference. First operand 18554 states and 89954 transitions. Second operand has 49 states, 48 states have (on average 3.125) internal successors, (150), 48 states have internal predecessors, (150), 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) Received shutdown request... [2022-03-15 22:29:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 482 states. [2022-03-15 22:29:19,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126042 ImplicationChecksByTransitivity, 107.9s TimeCoverageRelationStatistics Valid=40853, Invalid=238459, Unknown=0, NotChecked=0, Total=279312 [2022-03-15 22:29:19,333 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 721 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:19,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 0 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 22:29:19,335 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:29:19,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 22:29:19,353 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:29:19,355 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:29:19,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:19,543 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 482 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 529 known predicates. [2022-03-15 22:29:19,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:29:19,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:29:19,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:29:19,545 INFO L732 BasicCegarLoop]: Path program histogram: [35, 13, 1, 1, 1] [2022-03-15 22:29:19,547 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:29:19,547 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:29:19,549 INFO L202 PluginConnector]: Adding new model sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:29:19 BasicIcfg [2022-03-15 22:29:19,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:29:19,549 INFO L158 Benchmark]: Toolchain (without parser) took 718173.47ms. Allocated memory was 204.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 163.9MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 921.7MB. Max. memory is 8.0GB. [2022-03-15 22:29:19,549 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:29:19,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.39ms. Allocated memory is still 204.5MB. Free memory was 163.9MB in the beginning and 162.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:29:19,549 INFO L158 Benchmark]: Boogie Preprocessor took 14.93ms. Allocated memory is still 204.5MB. Free memory was 162.3MB in the beginning and 161.4MB in the end (delta: 932.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:29:19,550 INFO L158 Benchmark]: RCFGBuilder took 249.14ms. Allocated memory is still 204.5MB. Free memory was 161.3MB in the beginning and 152.1MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:29:19,550 INFO L158 Benchmark]: TraceAbstraction took 717882.97ms. Allocated memory was 204.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 151.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 909.1MB. Max. memory is 8.0GB. [2022-03-15 22:29:19,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.39ms. Allocated memory is still 204.5MB. Free memory was 163.9MB in the beginning and 162.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.93ms. Allocated memory is still 204.5MB. Free memory was 162.3MB in the beginning and 161.4MB in the end (delta: 932.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.14ms. Allocated memory is still 204.5MB. Free memory was 161.3MB in the beginning and 152.1MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 717882.97ms. Allocated memory was 204.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 151.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 909.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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 - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 482 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 529 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 482 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 529 known predicates. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 482 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 529 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 482 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 529 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 717.8s, OverallIterations: 51, TraceHistogramMax: 5, PathProgramHistogramMax: 35, EmptinessCheckTime: 0.8s, AutomataDifference: 561.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26816 SdHoareTripleChecker+Valid, 49.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26816 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 42.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19903 mSDsCounter, 12977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85749 IncrementalHoareTripleChecker+Invalid, 98726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12977 mSolverCounterUnsat, 0 mSDtfsCounter, 85749 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11305 GetRequests, 2423 SyntacticMatches, 256 SemanticMatches, 8625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953375 ImplicationChecksByTransitivity, 536.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18554occurred in iteration=50, InterpolantAutomatonStates: 6890, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 50 MinimizatonAttempts, 225467 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 50.6s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 2306 ConstructedInterpolants, 27 QuantifiedInterpolants, 26906 SizeOfPredicates, 165 NumberOfNonLiveVariables, 3406 ConjunctsInSsa, 743 ConjunctsInUnsatCore, 147 InterpolantComputations, 3 PerfectInterpolantSequences, 490/1499 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown