/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-bad/three-array-sum-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:51:13,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:51:13,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:51:13,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:51:13,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:51:13,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:51:13,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:51:13,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:51:13,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:51:13,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:51:13,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:51:13,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:51:13,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:51:13,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:51:13,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:51:13,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:51:13,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:51:13,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:51:13,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:51:13,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:51:13,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:51:13,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:51:13,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:51:13,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:51:13,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:51:13,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:51:13,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:51:13,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:51:13,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:51:13,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:51:13,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:51:13,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:51:13,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:51:13,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:51:13,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:51:13,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:51:13,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:51:13,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:51:13,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:51:13,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:51:13,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:51:13,225 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 21:51:13,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:51:13,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:51:13,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:51:13,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:51:13,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:51:13,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:51:13,257 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:51:13,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:51:13,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:51:13,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:51:13,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:51:13,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:51:13,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:51:13,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:13,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:51:13,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:51:13,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:51:13,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:51:13,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:51:13,263 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:51:13,263 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:51:13,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:51:13,263 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 21:51:13,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:51:13,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:51:13,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:51:13,514 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:51:13,516 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:51:13,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/three-array-sum-alt.wvr.bpl [2022-03-15 21:51:13,518 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/three-array-sum-alt.wvr.bpl' [2022-03-15 21:51:13,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:51:13,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:51:13,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:13,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:51:13,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:51:13,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,585 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:51:13,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:13,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:51:13,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:51:13,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:51:13,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:51:13,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:51:13,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:51:13,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:51:13,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/1) ... [2022-03-15 21:51:13,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:13,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:13,649 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 21:51:13,658 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 21:51:13,682 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:51:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:51:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:51:13,683 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:51:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:51:13,683 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:51:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:51:13,683 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:51:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:51:13,684 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 21:51:13,726 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:51:13,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:51:13,797 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:51:13,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:51:13,812 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:51:13,814 INFO L202 PluginConnector]: Adding new model three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:13 BoogieIcfgContainer [2022-03-15 21:51:13,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:51:13,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:51:13,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:51:13,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:51:13,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:13" (1/2) ... [2022-03-15 21:51:13,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436b6c0f and model type three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:51:13, skipping insertion in model container [2022-03-15 21:51:13,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:13" (2/2) ... [2022-03-15 21:51:13,821 INFO L111 eAbstractionObserver]: Analyzing ICFG three-array-sum-alt.wvr.bpl [2022-03-15 21:51:13,825 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:51:13,826 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:51:13,826 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:51:13,826 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:51:13,877 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:51:13,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:51:13,932 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 21:51:13,933 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:51:13,943 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:51:13,950 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 78 flow [2022-03-15 21:51:13,952 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 78 flow [2022-03-15 21:51:13,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 78 flow [2022-03-15 21:51:13,975 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2022-03-15 21:51:13,975 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:51:13,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 3/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 21:51:13,979 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 21:51:14,251 INFO L131 LiptonReduction]: Checked pairs total: 96 [2022-03-15 21:51:14,251 INFO L133 LiptonReduction]: Total number of compositions: 10 [2022-03-15 21:51:14,257 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 21:51:14,275 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 21:51:14,277 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 21:51:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:51:14,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:14,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:14,282 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1246177528, now seen corresponding path program 1 times [2022-03-15 21:51:14,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:14,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070382224] [2022-03-15 21:51:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:14,468 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 21:51:14,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:14,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070382224] [2022-03-15 21:51:14,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070382224] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:14,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:14,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:51:14,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366924054] [2022-03-15 21:51:14,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:14,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:14,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:51:14,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:14,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:14,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:51:14,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:51:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:51:14,961 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 21:51:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:15,004 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 21:51:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:51:15,007 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 21:51:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:15,017 INFO L225 Difference]: With dead ends: 45 [2022-03-15 21:51:15,018 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 21:51:15,022 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 21:51:15,025 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 21:51:15,025 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 21:51:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 21:51:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 21:51:15,052 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 21:51:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 21:51:15,054 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 21:51:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:15,054 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 21:51:15,055 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 21:51:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 21:51:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:15,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:15,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:15,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:51:15,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1598899738, now seen corresponding path program 1 times [2022-03-15 21:51:15,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:15,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306910653] [2022-03-15 21:51:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:15,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306910653] [2022-03-15 21:51:15,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306910653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:15,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569295023] [2022-03-15 21:51:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:15,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:15,092 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 21:51:15,114 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 21:51:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:15,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:51:15,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569295023] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:15,216 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:15,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 21:51:15,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154673882] [2022-03-15 21:51:15,217 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:15,218 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:15,223 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:15,223 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:15,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [288#(or (<= N i) (< (+ i 1) N) (< k N)), 286#(or (<= N i) (< (+ i 1) N)), 285#(< i N), 287#(or (< k N) (< i N))] [2022-03-15 21:51:15,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:51:15,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:51:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:15,430 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 21:51:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:15,592 INFO L93 Difference]: Finished difference Result 79 states and 201 transitions. [2022-03-15 21:51:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:51:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 21:51:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:15,594 INFO L225 Difference]: With dead ends: 79 [2022-03-15 21:51:15,594 INFO L226 Difference]: Without dead ends: 79 [2022-03-15 21:51:15,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:51:15,596 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:15,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-03-15 21:51:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-03-15 21:51:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 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 21:51:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 154 transitions. [2022-03-15 21:51:15,605 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 154 transitions. Word has length 12 [2022-03-15 21:51:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:15,605 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 154 transitions. [2022-03-15 21:51:15,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 21:51:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 154 transitions. [2022-03-15 21:51:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:15,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:15,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:15,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:51:15,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:15,820 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -65158896, now seen corresponding path program 1 times [2022-03-15 21:51:15,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:15,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359561128] [2022-03-15 21:51:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:15,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359561128] [2022-03-15 21:51:15,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359561128] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:15,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:15,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:15,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504442530] [2022-03-15 21:51:15,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:15,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:15,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 56 transitions. [2022-03-15 21:51:15,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:15,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [488#(< i N), 489#(or (<= N j) (< i N))] [2022-03-15 21:51:15,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:51:15,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:15,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:51:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:51:15,964 INFO L87 Difference]: Start difference. First operand 54 states and 154 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:16,058 INFO L93 Difference]: Finished difference Result 79 states and 202 transitions. [2022-03-15 21:51:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:51:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:51:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:16,070 INFO L225 Difference]: With dead ends: 79 [2022-03-15 21:51:16,070 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 21:51:16,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:51:16,073 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:16,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 21:51:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-03-15 21:51:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.890909090909091) internal successors, (159), 55 states have internal predecessors, (159), 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 21:51:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 159 transitions. [2022-03-15 21:51:16,084 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 159 transitions. Word has length 12 [2022-03-15 21:51:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:16,084 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 159 transitions. [2022-03-15 21:51:16,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 159 transitions. [2022-03-15 21:51:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:16,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:16,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:16,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:51:16,086 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash -7900594, now seen corresponding path program 1 times [2022-03-15 21:51:16,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:16,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126537537] [2022-03-15 21:51:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:16,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:16,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126537537] [2022-03-15 21:51:16,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126537537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:16,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:16,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:16,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175829479] [2022-03-15 21:51:16,148 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:16,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:16,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:16,151 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:16,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [691#(< i N), 695#(or (<= N k) (< (+ k 1) N) (< i N)), 694#(or (<= N k) (< (+ k 1) N)), 692#(< k N), 693#(or (< k N) (< i N))] [2022-03-15 21:51:16,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:51:16,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:16,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:51:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:51:16,306 INFO L87 Difference]: Start difference. First operand 56 states and 159 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 21:51:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:16,425 INFO L93 Difference]: Finished difference Result 69 states and 171 transitions. [2022-03-15 21:51:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:51:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 21:51:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:16,426 INFO L225 Difference]: With dead ends: 69 [2022-03-15 21:51:16,426 INFO L226 Difference]: Without dead ends: 61 [2022-03-15 21:51:16,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:51:16,430 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:16,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-15 21:51:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-03-15 21:51:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 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 21:51:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 112 transitions. [2022-03-15 21:51:16,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 112 transitions. Word has length 12 [2022-03-15 21:51:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:16,446 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 112 transitions. [2022-03-15 21:51:16,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 21:51:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 112 transitions. [2022-03-15 21:51:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:16,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:16,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:16,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:51:16,447 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2004818564, now seen corresponding path program 1 times [2022-03-15 21:51:16,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:16,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302430600] [2022-03-15 21:51:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:16,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:16,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302430600] [2022-03-15 21:51:16,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302430600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:16,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984484270] [2022-03-15 21:51:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:16,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:16,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:16,478 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 21:51:16,480 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 21:51:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:16,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:51:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:16,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:16,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984484270] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:16,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:16,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-03-15 21:51:16,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [45695918] [2022-03-15 21:51:16,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:16,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:16,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 21:51:16,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:16,840 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [932#(< k N), 933#(or (<= N k) (< (+ k 1) N))] [2022-03-15 21:51:16,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:51:16,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:51:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:51:16,841 INFO L87 Difference]: Start difference. First operand 42 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 21:51:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:16,972 INFO L93 Difference]: Finished difference Result 95 states and 237 transitions. [2022-03-15 21:51:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:51:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 21:51:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:16,974 INFO L225 Difference]: With dead ends: 95 [2022-03-15 21:51:16,974 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 21:51:16,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:16,975 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:16,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 21:51:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2022-03-15 21:51:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.830769230769231) internal successors, (184), 65 states have internal predecessors, (184), 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 21:51:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 184 transitions. [2022-03-15 21:51:16,980 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 184 transitions. Word has length 13 [2022-03-15 21:51:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:16,980 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 184 transitions. [2022-03-15 21:51:16,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 21:51:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 184 transitions. [2022-03-15 21:51:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:16,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:16,982 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:17,010 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 21:51:17,199 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 21:51:17,199 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1625731200, now seen corresponding path program 2 times [2022-03-15 21:51:17,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:17,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132964893] [2022-03-15 21:51:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:17,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:17,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132964893] [2022-03-15 21:51:17,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132964893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:17,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:17,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:17,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426036136] [2022-03-15 21:51:17,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:17,227 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:17,230 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 21:51:17,230 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:17,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1173#(< k N), 1177#(or (<= N i) (< (+ i 1) N) (< k N)), 1174#(< i N), 1178#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1175#(or (< k N) (< i N)), 1179#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 1176#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:51:17,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:51:17,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:51:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:17,446 INFO L87 Difference]: Start difference. First operand 66 states and 184 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 21:51:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:17,628 INFO L93 Difference]: Finished difference Result 123 states and 344 transitions. [2022-03-15 21:51:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:51:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 21:51:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:17,631 INFO L225 Difference]: With dead ends: 123 [2022-03-15 21:51:17,631 INFO L226 Difference]: Without dead ends: 121 [2022-03-15 21:51:17,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:51:17,632 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:17,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-15 21:51:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2022-03-15 21:51:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.045977011494253) internal successors, (265), 87 states have internal predecessors, (265), 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 21:51:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 265 transitions. [2022-03-15 21:51:17,646 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 265 transitions. Word has length 13 [2022-03-15 21:51:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:17,646 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 265 transitions. [2022-03-15 21:51:17,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 21:51:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 265 transitions. [2022-03-15 21:51:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:17,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:17,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:17,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 21:51:17,649 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash 469023704, now seen corresponding path program 1 times [2022-03-15 21:51:17,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:17,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459340813] [2022-03-15 21:51:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:17,802 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 21:51:17,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:17,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459340813] [2022-03-15 21:51:17,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459340813] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:17,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565159926] [2022-03-15 21:51:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:17,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:17,805 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 21:51:17,806 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 21:51:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:17,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:51:17,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:18,006 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 15 treesize of output 11 [2022-03-15 21:51:18,009 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 13 treesize of output 9 [2022-03-15 21:51:18,034 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 21:51:18,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:18,077 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:18,078 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 15 treesize of output 20 [2022-03-15 21:51:18,100 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 15 treesize of output 9 [2022-03-15 21:51:18,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:18,129 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 12 treesize of output 17 [2022-03-15 21:51:18,147 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 21:51:18,179 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 21:51:18,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565159926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:18,181 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:18,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 21:51:18,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843517778] [2022-03-15 21:51:18,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:18,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:18,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 21:51:18,191 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:19,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1575#(and (<= (+ (select A i) asum bsum (select B j)) csum) (< csum (+ (select A i) asum bsum (select B j) 1))), 1572#(and (< csum (+ (select A i) asum bsum 1)) (<= (+ (select A i) asum bsum) csum)), 1574#(and (<= (+ asum bsum (select B j)) csum) (< csum (+ asum bsum (select B j) 1))), 1573#(and (<= (+ (select A i) asum bsum) (+ csum (select A k) (select B k))) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum)))] [2022-03-15 21:51:19,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:51:19,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:51:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:51:19,051 INFO L87 Difference]: Start difference. First operand 88 states and 265 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 21:51:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:19,262 INFO L93 Difference]: Finished difference Result 151 states and 448 transitions. [2022-03-15 21:51:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:51:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 21:51:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:19,264 INFO L225 Difference]: With dead ends: 151 [2022-03-15 21:51:19,264 INFO L226 Difference]: Without dead ends: 147 [2022-03-15 21:51:19,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:51:19,265 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:19,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-03-15 21:51:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 127. [2022-03-15 21:51:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 3.1984126984126986) internal successors, (403), 126 states have internal predecessors, (403), 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 21:51:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 403 transitions. [2022-03-15 21:51:19,272 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 403 transitions. Word has length 14 [2022-03-15 21:51:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:19,273 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 403 transitions. [2022-03-15 21:51:19,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 21:51:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 403 transitions. [2022-03-15 21:51:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:19,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:19,274 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:19,300 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 21:51:19,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:19,488 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1326267630, now seen corresponding path program 2 times [2022-03-15 21:51:19,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:19,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363177823] [2022-03-15 21:51:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:51:19,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:19,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363177823] [2022-03-15 21:51:19,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363177823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:19,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:19,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:19,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072421653] [2022-03-15 21:51:19,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:19,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:19,522 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:51:19,522 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:19,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1985#(< j N)] [2022-03-15 21:51:19,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:51:19,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:51:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:51:19,690 INFO L87 Difference]: Start difference. First operand 127 states and 403 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:51:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:19,762 INFO L93 Difference]: Finished difference Result 155 states and 453 transitions. [2022-03-15 21:51:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:51:19,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:51:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:19,764 INFO L225 Difference]: With dead ends: 155 [2022-03-15 21:51:19,764 INFO L226 Difference]: Without dead ends: 147 [2022-03-15 21:51:19,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:19,765 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:19,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:51:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-03-15 21:51:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 119. [2022-03-15 21:51:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 3.1440677966101696) internal successors, (371), 118 states have internal predecessors, (371), 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 21:51:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 371 transitions. [2022-03-15 21:51:19,782 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 371 transitions. Word has length 14 [2022-03-15 21:51:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:19,782 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 371 transitions. [2022-03-15 21:51:19,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 21:51:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 371 transitions. [2022-03-15 21:51:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:19,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:19,784 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:19,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:51:19,784 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1281235846, now seen corresponding path program 2 times [2022-03-15 21:51:19,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:19,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811803793] [2022-03-15 21:51:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:19,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811803793] [2022-03-15 21:51:19,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811803793] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182566065] [2022-03-15 21:51:19,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:19,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:19,844 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 21:51:19,881 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 21:51:19,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:19,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:19,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:51:19,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:19,934 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 21:51:19,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:19,989 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 21:51:19,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182566065] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:19,990 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:19,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:51:19,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731938264] [2022-03-15 21:51:19,990 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:19,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:19,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 21:51:19,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:20,772 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [2480#(or (<= N i) (< (+ i 1) N)), 2491#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 2487#(or (<= (+ 2 k) N) (< i N)), 2484#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 2485#(or (<= (+ 2 k) N) (<= N k)), 2489#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 2488#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 2486#(or (<= (+ 2 k) N) (<= N k) (< i N)), 2481#(or (<= N (+ i 1)) (< (+ 2 i) N)), 2482#(or (< k N) (< i N)), 2483#(or (<= N i) (< (+ i 1) N) (< k N)), 2479#(< i N), 2490#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N))] [2022-03-15 21:51:20,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:51:20,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:51:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:51:20,774 INFO L87 Difference]: Start difference. First operand 119 states and 371 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 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 21:51:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:21,286 INFO L93 Difference]: Finished difference Result 247 states and 725 transitions. [2022-03-15 21:51:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:51:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 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 21:51:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:21,288 INFO L225 Difference]: With dead ends: 247 [2022-03-15 21:51:21,288 INFO L226 Difference]: Without dead ends: 247 [2022-03-15 21:51:21,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:51:21,289 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:21,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-03-15 21:51:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 140. [2022-03-15 21:51:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.2158273381294964) internal successors, (447), 139 states have internal predecessors, (447), 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 21:51:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 447 transitions. [2022-03-15 21:51:21,295 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 447 transitions. Word has length 15 [2022-03-15 21:51:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:21,296 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 447 transitions. [2022-03-15 21:51:21,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 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 21:51:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 447 transitions. [2022-03-15 21:51:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:21,296 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:21,297 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:21,322 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 21:51:21,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:21,520 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -151277316, now seen corresponding path program 3 times [2022-03-15 21:51:21,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:21,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351770678] [2022-03-15 21:51:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:21,550 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 21:51:21,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:21,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351770678] [2022-03-15 21:51:21,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351770678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:21,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391270540] [2022-03-15 21:51:21,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:51:21,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:21,552 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 21:51:21,561 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 21:51:21,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:51:21,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:21,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:51:21,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:21,616 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 21:51:21,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:21,650 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 21:51:21,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391270540] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:21,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:21,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-03-15 21:51:21,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299858103] [2022-03-15 21:51:21,651 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:21,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:21,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 21:51:21,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:22,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3147#(or (<= N j) (< i N)), 3150#(or (<= N i) (< (+ i 1) N) (<= N (+ j 1))), 3145#(< i N), 3146#(or (<= N i) (< (+ i 1) N)), 3149#(or (<= N (+ j 1)) (< i N)), 3148#(or (<= N j) (<= N i) (< (+ i 1) N))] [2022-03-15 21:51:22,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:51:22,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:51:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:51:22,131 INFO L87 Difference]: Start difference. First operand 140 states and 447 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 21:51:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:22,384 INFO L93 Difference]: Finished difference Result 396 states and 1263 transitions. [2022-03-15 21:51:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:51:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 21:51:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:22,387 INFO L225 Difference]: With dead ends: 396 [2022-03-15 21:51:22,387 INFO L226 Difference]: Without dead ends: 390 [2022-03-15 21:51:22,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:51:22,388 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:22,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-15 21:51:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 251. [2022-03-15 21:51:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.6) internal successors, (900), 250 states have internal predecessors, (900), 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 21:51:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 900 transitions. [2022-03-15 21:51:22,398 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 900 transitions. Word has length 15 [2022-03-15 21:51:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:22,399 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 900 transitions. [2022-03-15 21:51:22,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 21:51:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 900 transitions. [2022-03-15 21:51:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:22,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:22,400 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:22,426 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 21:51:22,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:51:22,624 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1623730046, now seen corresponding path program 4 times [2022-03-15 21:51:22,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:22,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107596132] [2022-03-15 21:51:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:22,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:22,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107596132] [2022-03-15 21:51:22,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107596132] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:22,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514890645] [2022-03-15 21:51:22,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:22,667 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 21:51:22,696 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 21:51:22,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:22,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:22,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:51:22,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:22,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:22,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514890645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:22,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:22,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-03-15 21:51:22,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282888409] [2022-03-15 21:51:22,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:22,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:22,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 21:51:22,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:23,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4173#(or (<= N (+ k 1)) (< i N)), 4178#(or (<= N i) (< (+ i 1) N) (<= N k)), 4174#(or (<= N i) (< (+ i 1) N)), 4179#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 4166#(or (<= N k) (< (+ k 1) N)), 4175#(or (<= N i) (< (+ i 1) N) (< k N)), 4176#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 4172#(or (<= N k) (< i N)), 4165#(< k N), 4177#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 4167#(< i N), 4170#(or (<= N (+ k 1)) (< (+ 2 k) N)), 4169#(or (<= N k) (< (+ k 1) N) (< i N)), 4168#(or (< k N) (< i N)), 4171#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N))] [2022-03-15 21:51:23,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:51:23,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:51:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:51:23,411 INFO L87 Difference]: Start difference. First operand 251 states and 900 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 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 21:51:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:23,808 INFO L93 Difference]: Finished difference Result 564 states and 1956 transitions. [2022-03-15 21:51:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:51:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 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) Word has length 15 [2022-03-15 21:51:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:23,812 INFO L225 Difference]: With dead ends: 564 [2022-03-15 21:51:23,812 INFO L226 Difference]: Without dead ends: 539 [2022-03-15 21:51:23,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:51:23,813 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:23,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-03-15 21:51:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 348. [2022-03-15 21:51:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.7838616714697406) internal successors, (1313), 347 states have internal predecessors, (1313), 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 21:51:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1313 transitions. [2022-03-15 21:51:23,827 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1313 transitions. Word has length 15 [2022-03-15 21:51:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:23,827 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 1313 transitions. [2022-03-15 21:51:23,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 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 21:51:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1313 transitions. [2022-03-15 21:51:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:51:23,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:23,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:23,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:24,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:24,044 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1032502672, now seen corresponding path program 5 times [2022-03-15 21:51:24,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:24,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32530636] [2022-03-15 21:51:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:24,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:24,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32530636] [2022-03-15 21:51:24,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32530636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:24,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768282791] [2022-03-15 21:51:24,100 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:24,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:24,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:24,104 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 21:51:24,105 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 21:51:24,142 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:51:24,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:24,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:51:24,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:24,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:24,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768282791] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:24,228 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:24,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 21:51:24,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958793412] [2022-03-15 21:51:24,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:24,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:24,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 21:51:24,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:25,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5574#(or (<= N (+ i 1)) (< (+ 2 i) N)), 5572#(or (<= (+ j 1) N) (< i N)), 5575#(or (<= N (+ i 1)) (<= (+ j 1) N) (< (+ 2 i) N)), 5576#(or (<= N j) (<= (+ 2 j) N)), 5577#(or (<= N j) (<= (+ 2 j) N) (< i N)), 5570#(< i N), 5578#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 5571#(or (<= N i) (< (+ i 1) N)), 5573#(or (<= (+ j 1) N) (<= N i) (< (+ i 1) N)), 5579#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 2 j) N))] [2022-03-15 21:51:25,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:51:25,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:51:25,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:51:25,099 INFO L87 Difference]: Start difference. First operand 348 states and 1313 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 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 21:51:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:25,593 INFO L93 Difference]: Finished difference Result 1011 states and 3618 transitions. [2022-03-15 21:51:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:51:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 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 21:51:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:25,603 INFO L225 Difference]: With dead ends: 1011 [2022-03-15 21:51:25,604 INFO L226 Difference]: Without dead ends: 1011 [2022-03-15 21:51:25,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:51:25,605 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:25,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-03-15 21:51:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 685. [2022-03-15 21:51:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 4.0248538011695905) internal successors, (2753), 684 states have internal predecessors, (2753), 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 21:51:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2753 transitions. [2022-03-15 21:51:25,633 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 2753 transitions. Word has length 16 [2022-03-15 21:51:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:25,634 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 2753 transitions. [2022-03-15 21:51:25,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 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 21:51:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 2753 transitions. [2022-03-15 21:51:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:51:25,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:25,637 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:25,663 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 21:51:25,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:25,858 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -291653796, now seen corresponding path program 6 times [2022-03-15 21:51:25,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:25,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610171477] [2022-03-15 21:51:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:25,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:25,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610171477] [2022-03-15 21:51:25,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610171477] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:25,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266285752] [2022-03-15 21:51:25,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:51:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:25,905 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 21:51:25,936 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 21:51:25,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:51:25,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:25,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:51:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:25,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:26,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266285752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:26,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:26,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-15 21:51:26,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94227025] [2022-03-15 21:51:26,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:26,013 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:26,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 21:51:26,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:27,054 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [8112#(or (<= (+ k 1) i) (<= N k)), 8096#(< k N), 8106#(or (<= N (+ i 1)) (< (+ 2 i) N)), 8100#(or (< k N) (< i N)), 8101#(or (<= N k) (< (+ k 1) N) (< i N)), 8104#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 8107#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 8103#(or (<= N i) (< (+ i 1) N) (< k N)), 8111#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 8109#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 8102#(or (<= N i) (< (+ i 1) N)), 8108#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 8105#(or (<= (+ 2 k) i) (<= N k)), 8110#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 8097#(or (<= N k) (< (+ k 1) N)), 8099#(< i N), 8098#(or (<= (+ 3 k) N) (<= N k))] [2022-03-15 21:51:27,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:27,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:51:27,055 INFO L87 Difference]: Start difference. First operand 685 states and 2753 transitions. Second operand has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 22 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 21:51:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:27,995 INFO L93 Difference]: Finished difference Result 1941 states and 7046 transitions. [2022-03-15 21:51:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:51:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 22 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 16 [2022-03-15 21:51:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:28,009 INFO L225 Difference]: With dead ends: 1941 [2022-03-15 21:51:28,009 INFO L226 Difference]: Without dead ends: 1941 [2022-03-15 21:51:28,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=775, Invalid=2531, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:51:28,011 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 335 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:28,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2022-03-15 21:51:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1051. [2022-03-15 21:51:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 4.0304761904761905) internal successors, (4232), 1050 states have internal predecessors, (4232), 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 21:51:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 4232 transitions. [2022-03-15 21:51:28,061 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 4232 transitions. Word has length 16 [2022-03-15 21:51:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:28,062 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 4232 transitions. [2022-03-15 21:51:28,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 22 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 21:51:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 4232 transitions. [2022-03-15 21:51:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:51:28,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:28,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:28,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:28,279 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,SelfDestructingSolverStorable12 [2022-03-15 21:51:28,280 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1573911800, now seen corresponding path program 7 times [2022-03-15 21:51:28,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:28,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312478788] [2022-03-15 21:51:28,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:28,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:28,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:28,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312478788] [2022-03-15 21:51:28,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312478788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:28,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800454551] [2022-03-15 21:51:28,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:51:28,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:28,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:28,544 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 21:51:28,565 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 21:51:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:28,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 21:51:28,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:28,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-03-15 21:51:28,854 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 42 treesize of output 34 [2022-03-15 21:51:28,861 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 18 treesize of output 14 [2022-03-15 21:51:28,863 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 24 treesize of output 16 [2022-03-15 21:51:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:28,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:29,026 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:51:29,026 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 30 treesize of output 55 [2022-03-15 21:51:29,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:29,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:29,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:29,115 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 31 treesize of output 15 [2022-03-15 21:51:29,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:29,216 INFO L353 Elim1Store]: treesize reduction 14, result has 72.5 percent of original size [2022-03-15 21:51:29,216 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 22 treesize of output 47 [2022-03-15 21:51:29,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:29,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:29,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:29,316 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 23 treesize of output 6 [2022-03-15 21:51:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:29,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800454551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:29,357 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:29,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-03-15 21:51:29,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22035893] [2022-03-15 21:51:29,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:29,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:29,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 242 transitions. [2022-03-15 21:51:29,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:35,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [12376#(and (or (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1))) (or (<= (+ 2 k) N) (<= N (+ j 1)) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1)))))), 12378#(and (or (< csum (+ (select A i) asum bsum (select B j) 1 (select B (+ j 1)))) (< (+ i 1) N) (not (< i N)) (<= N (+ j 1))) (or (< (+ i 1) N) (not (< i N)) (<= N (+ j 1)) (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) csum))), 12361#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 12359#(and (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1)) 1)))), 12339#(and (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< k N)) (or (<= N j) (< k N) (< csum (+ asum bsum (select B j) 1)))), 12374#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (< k N) (<= N (+ j 1))) (or (< k N) (<= N (+ j 1)) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 12366#(and (or (<= N j) (<= (+ (select A i) asum bsum (select B j)) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= N j) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j))))), 12383#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= N (+ j 1)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))))), 12353#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) asum bsum) csum)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) asum bsum 1)))), 12352#(and (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum 1))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum) csum))), 12364#(and (or (<= N j) (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B j) 1))) (or (<= N j) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j)) csum) (not (< i N)))), 12345#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)) (< i N)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (not (< (+ k 1) N)) (< i N))), 12368#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) csum)) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1)))), 12371#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (= (+ j 1) N) (< (+ 2 i) N) (< (+ 2 k) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 12375#(and (or (< k N) (<= N (+ j 1)) (< i N) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1))))) (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (< k N) (<= N (+ j 1)) (< i N))), 12340#(and (or (<= N j) (<= (+ 2 k) N) (<= (+ asum bsum (select B j)) (+ csum (select A k) (select B k)))) (or (<= N j) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 2 k) N))), 12379#(and (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ j 1)))), 12355#(and (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A i) asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum 1)))), 12344#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ csum (select A k) (select B k)) (+ asum bsum 1)) (< i N)) (or (not (< k N)) (<= (+ 2 k) N) (< i N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 12338#(and (or (<= N j) (< csum (+ asum bsum (select B j) 1))) (or (<= (+ asum bsum (select B j)) csum) (<= N j))), 12356#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) csum)) (or (< csum (+ (select A i) asum bsum (select A (+ i 1)) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N))), 12370#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1))))) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) (+ csum (select A k) (select B k))))), 12346#(and (or (<= (+ 2 k) N) (< i N) (<= (+ csum (select A k) (select B k)) (+ asum bsum))) (or (<= (+ 2 k) N) (< i N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 12373#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (<= N (+ j 1)) (< i N)) (or (<= N (+ j 1)) (< i N) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 12343#(and (or (< k N) (< i N) (< csum (+ asum bsum 1))) (or (< k N) (<= (+ asum bsum) csum) (< i N))), 12377#(and (or (<= (+ 2 k) N) (<= N (+ j 1)) (< i N) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1))))) (or (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1)) (< i N))), 12382#(and (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (< k N) (<= N (+ j 1)))), 12372#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (<= N (+ j 1))) (or (<= N (+ j 1)) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 12347#(and (or (<= (+ 2 k) N) (< i N)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (< i N)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< i N))), 12341#(and (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (not (< (+ k 1) N))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)))), 12367#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B j)) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j)))) (or (< (+ i 1) N) (= (+ j 1) N) (not (< i N)) (< (+ 2 k) N))), 12357#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) asum bsum (select A (+ i 1))) csum)) (or (< csum (+ (select A i) asum bsum (select A (+ i 1)) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 12369#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1))) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) csum))), 12363#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 12358#(and (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1)) 1))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k))) (< (+ k 1) N))), 12349#(and (or (<= N j) (< k N) (< csum (+ asum bsum (select B j) 1)) (< i N)) (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< k N) (< i N))), 12351#(and (or (<= (+ 2 k) N) (< i N)) (or (= (+ j 1) N) (< (+ 2 k) N) (< i N)) (or (<= (+ 3 k) N) (<= (+ asum bsum (select B j)) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 3 k) N) (< i N))), 12360#(and (or (<= (+ (select A i) asum bsum) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum)))), 12354#(and (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum 1))) (or (not (< k N)) (<= (+ (select A i) asum bsum) (+ csum (select A k) (select B k))) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N))), 12380#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= N (+ j 1)) (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) csum)) (or (< csum (+ (select A i) asum bsum (select B j) 1 (select B (+ j 1)))) (< (+ i 1) N) (not (< i N)) (< k N) (<= N (+ j 1)))), 12348#(and (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< i N)) (or (<= N j) (< csum (+ asum bsum (select B j) 1)) (< i N))), 12350#(and (or (<= N j) (<= (+ 2 k) N) (<= (+ asum bsum (select B j)) (+ csum (select A k) (select B k))) (< i N)) (or (<= N j) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 2 k) N) (< i N))), 12337#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ csum (select A k) (select B k)) (+ asum bsum 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 12362#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k))))), 12342#(and (or (< i N) (< csum (+ asum bsum 1))) (or (<= (+ asum bsum) csum) (< i N))), 12381#(and (or (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= N (+ j 1))) (or (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ j 1)))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= N (+ j 1)))), 12365#(and (or (<= N j) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j)) csum) (not (< i N)) (< k N)) (or (<= N j) (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) asum bsum (select B j) 1))))] [2022-03-15 21:51:35,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 21:51:35,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 21:51:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=4075, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:51:35,848 INFO L87 Difference]: Start difference. First operand 1051 states and 4232 transitions. Second operand has 57 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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 21:54:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:24,995 INFO L93 Difference]: Finished difference Result 5683 states and 17974 transitions. [2022-03-15 21:54:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 645 states. [2022-03-15 21:54:24,996 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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 21:54:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:25,027 INFO L225 Difference]: With dead ends: 5683 [2022-03-15 21:54:25,027 INFO L226 Difference]: Without dead ends: 5497 [2022-03-15 21:54:25,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 701 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218584 ImplicationChecksByTransitivity, 165.2s TimeCoverageRelationStatistics Valid=55763, Invalid=437743, Unknown=0, NotChecked=0, Total=493506 [2022-03-15 21:54:25,063 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3300 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 6525 mSolverCounterSat, 1167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1167 IncrementalHoareTripleChecker+Valid, 6525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:25,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3300 Valid, 0 Invalid, 7692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1167 Valid, 6525 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 21:54:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2022-03-15 21:54:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 1307. [2022-03-15 21:54:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 4.090352220520674) internal successors, (5342), 1306 states have internal predecessors, (5342), 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 21:54:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 5342 transitions. [2022-03-15 21:54:25,155 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 5342 transitions. Word has length 17 [2022-03-15 21:54:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:25,156 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 5342 transitions. [2022-03-15 21:54:25,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.107142857142857) internal successors, (174), 56 states have internal predecessors, (174), 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 21:54:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 5342 transitions. [2022-03-15 21:54:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:54:25,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:25,160 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:25,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:54:25,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:54:25,384 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -50833090, now seen corresponding path program 8 times [2022-03-15 21:54:25,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:25,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495820806] [2022-03-15 21:54:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:25,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:25,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495820806] [2022-03-15 21:54:25,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495820806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:25,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447531035] [2022-03-15 21:54:25,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:25,436 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 21:54:25,437 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 21:54:25,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:25,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:25,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:25,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:25,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:25,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447531035] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:25,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:25,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-03-15 21:54:25,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335017977] [2022-03-15 21:54:25,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:25,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:25,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 203 transitions. [2022-03-15 21:54:25,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:26,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [22069#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 22076#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 22072#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 22074#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 22061#(or (< k N) (< i N)), 22080#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= N k) (< (+ k 1) N)), 22066#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 22059#(< i N), 22077#(or (<= N i) (<= N k) (< (+ k 1) N)), 22058#(< k N), 22073#(or (<= N i) (< k N)), 22060#(or (<= N i) (< (+ i 1) N)), 22075#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 22063#(or (<= N k) (< (+ k 1) N)), 22068#(or (<= N (+ i 1)) (< (+ 2 i) N)), 22071#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 22065#(or (< k N) (<= (+ 2 N) i)), 22070#(or (<= (+ N 1) i) (< k N)), 22062#(or (<= N i) (< (+ i 1) N) (< k N)), 22079#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 22064#(or (<= N k) (< (+ k 1) N) (< i N)), 22078#(or (< (+ i 4) N) (<= N (+ 3 i))), 22067#(or (<= N k) (< (+ k 1) N) (<= (+ 2 N) i))] [2022-03-15 21:54:26,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:54:26,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:54:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:54:26,828 INFO L87 Difference]: Start difference. First operand 1307 states and 5342 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 21:54:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:27,650 INFO L93 Difference]: Finished difference Result 3766 states and 14714 transitions. [2022-03-15 21:54:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:54:27,650 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 17 [2022-03-15 21:54:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:27,671 INFO L225 Difference]: With dead ends: 3766 [2022-03-15 21:54:27,671 INFO L226 Difference]: Without dead ends: 3738 [2022-03-15 21:54:27,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=824, Invalid=3208, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:54:27,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 567 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:27,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 0 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2022-03-15 21:54:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 2034. [2022-03-15 21:54:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 2033 states have (on average 4.169699950811609) internal successors, (8477), 2033 states have internal predecessors, (8477), 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 21:54:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 8477 transitions. [2022-03-15 21:54:27,759 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 8477 transitions. Word has length 17 [2022-03-15 21:54:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:27,759 INFO L470 AbstractCegarLoop]: Abstraction has 2034 states and 8477 transitions. [2022-03-15 21:54:27,759 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 21:54:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 8477 transitions. [2022-03-15 21:54:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:54:27,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:27,765 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:27,788 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 21:54:27,979 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,SelfDestructingSolverStorable14 [2022-03-15 21:54:27,979 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -768381808, now seen corresponding path program 9 times [2022-03-15 21:54:27,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:27,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706057873] [2022-03-15 21:54:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:54:28,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:28,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706057873] [2022-03-15 21:54:28,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706057873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:28,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491973926] [2022-03-15 21:54:28,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:28,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:28,016 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 21:54:28,017 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 21:54:28,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:54:28,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:28,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:54:28,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:54:28,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:54:28,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491973926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:28,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:28,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 21:54:28,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834722294] [2022-03-15 21:54:28,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:28,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:28,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 304 transitions. [2022-03-15 21:54:28,134 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:29,292 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [30085#(< i N), 30089#(or (<= N (+ j 1)) (< i N)), 30088#(or (<= N j) (<= N i) (< (+ i 1) N)), 30086#(or (<= N j) (< i N)), 30092#(or (<= N (+ 2 j)) (<= N i) (< (+ i 1) N)), 30090#(or (<= N i) (< (+ i 1) N) (<= N (+ j 1))), 30087#(or (<= N i) (< (+ i 1) N)), 30094#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N)), 30093#(or (<= N (+ i 1)) (< (+ 2 i) N)), 30095#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ j 1))), 30091#(or (<= N (+ 2 j)) (< i N)), 30096#(or (<= N (+ i 1)) (<= N (+ 2 j)) (< (+ 2 i) N))] [2022-03-15 21:54:29,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:54:29,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:54:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:54:29,294 INFO L87 Difference]: Start difference. First operand 2034 states and 8477 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 19 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 21:54:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:29,901 INFO L93 Difference]: Finished difference Result 6181 states and 24547 transitions. [2022-03-15 21:54:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:54:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 19 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 18 [2022-03-15 21:54:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:29,997 INFO L225 Difference]: With dead ends: 6181 [2022-03-15 21:54:29,998 INFO L226 Difference]: Without dead ends: 6078 [2022-03-15 21:54:29,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=731, Invalid=1719, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:54:29,998 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:29,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2022-03-15 21:54:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3099. [2022-03-15 21:54:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3098 states have (on average 4.3440929632020655) internal successors, (13458), 3098 states have internal predecessors, (13458), 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 21:54:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 13458 transitions. [2022-03-15 21:54:30,117 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 13458 transitions. Word has length 18 [2022-03-15 21:54:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:30,117 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 13458 transitions. [2022-03-15 21:54:30,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 19 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 21:54:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 13458 transitions. [2022-03-15 21:54:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:54:30,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:30,128 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:30,151 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 21:54:30,343 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,SelfDestructingSolverStorable15 [2022-03-15 21:54:30,343 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1577728434, now seen corresponding path program 10 times [2022-03-15 21:54:30,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:30,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535689032] [2022-03-15 21:54:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:30,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:30,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535689032] [2022-03-15 21:54:30,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535689032] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:30,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480290623] [2022-03-15 21:54:30,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:54:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:30,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:30,384 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 21:54:30,384 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 21:54:30,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:54:30,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:30,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:54:30,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:30,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:30,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480290623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:30,470 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:30,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 21:54:30,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373023095] [2022-03-15 21:54:30,470 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:30,472 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:30,486 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 295 transitions. [2022-03-15 21:54:30,487 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:31,893 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [42666#(or (<= N i) (< (+ i 1) N) (<= N k)), 42658#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 42663#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 42655#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 42667#(or (<= N (+ k 1)) (< i N)), 42664#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 42659#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 42669#(or (<= N (+ 2 k)) (< i N)), 42665#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 42653#(or (<= N (+ i 1)) (< (+ 2 i) N)), 42646#(< k N), 42672#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 42648#(< i N), 42652#(or (<= N i) (< (+ i 1) N)), 42657#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 42668#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 42660#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 42654#(or (<= N i) (< (+ i 1) N) (< k N)), 42651#(or (<= N k) (< i N)), 42670#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 42650#(or (<= N k) (< (+ k 1) N) (< i N)), 42673#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 42656#(or (<= N (+ k 1)) (< (+ 2 k) N)), 42671#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 42662#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 42647#(or (<= N k) (< (+ k 1) N)), 42661#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 42649#(or (< k N) (< i N))] [2022-03-15 21:54:31,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:54:31,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:54:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:54:31,895 INFO L87 Difference]: Start difference. First operand 3099 states and 13458 transitions. Second operand has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 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 21:54:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:33,013 INFO L93 Difference]: Finished difference Result 7585 states and 31770 transitions. [2022-03-15 21:54:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:54:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 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 21:54:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:33,047 INFO L225 Difference]: With dead ends: 7585 [2022-03-15 21:54:33,047 INFO L226 Difference]: Without dead ends: 7516 [2022-03-15 21:54:33,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1451, Invalid=4401, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 21:54:33,048 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 552 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:33,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2022-03-15 21:54:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 4128. [2022-03-15 21:54:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 4127 states have (on average 4.423794523867216) internal successors, (18257), 4127 states have internal predecessors, (18257), 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 21:54:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 18257 transitions. [2022-03-15 21:54:33,215 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 18257 transitions. Word has length 18 [2022-03-15 21:54:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:33,215 INFO L470 AbstractCegarLoop]: Abstraction has 4128 states and 18257 transitions. [2022-03-15 21:54:33,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 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 21:54:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 18257 transitions. [2022-03-15 21:54:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:54:33,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:33,231 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:33,257 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 21:54:33,455 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,SelfDestructingSolverStorable16 [2022-03-15 21:54:33,455 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1125003340, now seen corresponding path program 11 times [2022-03-15 21:54:33,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:33,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204815097] [2022-03-15 21:54:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:33,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:33,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204815097] [2022-03-15 21:54:33,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204815097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:33,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346460829] [2022-03-15 21:54:33,491 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:54:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:33,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:33,493 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 21:54:33,502 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 21:54:33,534 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:54:33,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:33,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:33,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:54:33,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:54:33,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346460829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:33,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:33,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-03-15 21:54:33,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753779577] [2022-03-15 21:54:33,601 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:33,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:33,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 119 states and 266 transitions. [2022-03-15 21:54:33,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:34,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [58717#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 58712#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 3 j) N)), 58707#(or (<= (+ 2 j) N) (< i N)), 58714#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 j) N)), 58719#(or (<= N (+ 2 i)) (<= (+ 2 j) N) (< (+ 3 i) N)), 58718#(or (<= N j) (<= (+ j 1) i)), 58713#(or (<= N (+ i 1)) (< (+ 2 i) N)), 58716#(or (<= N j) (<= (+ 2 j) i)), 58709#(or (<= N j) (<= (+ 3 j) N) (< i N)), 58715#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 3 j) N)), 58720#(or (<= N j) (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 3 j) N)), 58708#(or (<= N j) (<= (+ 3 j) N)), 58710#(or (<= N i) (< (+ i 1) N)), 58711#(or (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 58706#(< i N)] [2022-03-15 21:54:34,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:54:34,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:54:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:54:34,941 INFO L87 Difference]: Start difference. First operand 4128 states and 18257 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 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 21:54:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:35,671 INFO L93 Difference]: Finished difference Result 8071 states and 32751 transitions. [2022-03-15 21:54:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:54:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 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 21:54:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:35,770 INFO L225 Difference]: With dead ends: 8071 [2022-03-15 21:54:35,771 INFO L226 Difference]: Without dead ends: 8061 [2022-03-15 21:54:35,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=598, Invalid=1658, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:54:35,772 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:35,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2022-03-15 21:54:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 4788. [2022-03-15 21:54:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4788 states, 4787 states have (on average 4.44996866513474) internal successors, (21302), 4787 states have internal predecessors, (21302), 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 21:54:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 21302 transitions. [2022-03-15 21:54:35,996 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 21302 transitions. Word has length 18 [2022-03-15 21:54:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:35,996 INFO L470 AbstractCegarLoop]: Abstraction has 4788 states and 21302 transitions. [2022-03-15 21:54:35,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 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 21:54:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 21302 transitions. [2022-03-15 21:54:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:54:36,011 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:36,012 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:36,038 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 21:54:36,227 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,SelfDestructingSolverStorable17 [2022-03-15 21:54:36,227 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1171546372, now seen corresponding path program 12 times [2022-03-15 21:54:36,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:36,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866413671] [2022-03-15 21:54:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:36,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:36,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866413671] [2022-03-15 21:54:36,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866413671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:36,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981083535] [2022-03-15 21:54:36,273 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:54:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:36,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:36,275 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 21:54:36,287 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 21:54:36,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:54:36,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:36,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:54:36,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:36,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:36,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981083535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:36,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:36,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 21:54:36,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745036990] [2022-03-15 21:54:36,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:36,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:36,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 359 transitions. [2022-03-15 21:54:36,402 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:38,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [76536#(< i N), 76546#(or (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 76550#(or (<= (+ 3 j) N) (<= N (+ j 1)) (< i N)), 76553#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 j) N)), 76543#(or (<= N j) (<= (+ 2 j) N) (< i N)), 76537#(or (<= N i) (< (+ i 1) N)), 76547#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 76549#(or (<= (+ 3 j) N) (<= N (+ j 1))), 76554#(or (<= N j) (<= N (+ 2 i)) (<= (+ 2 j) N) (< (+ 3 i) N)), 76545#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 76555#(or (<= N (+ 2 i)) (<= (+ 2 j) N) (< (+ 3 i) N)), 76541#(or (<= N (+ i 1)) (<= (+ j 1) N) (< (+ 2 i) N)), 76540#(or (<= (+ j 1) N) (<= N i) (< (+ i 1) N)), 76556#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 j) N) (<= N (+ j 1))), 76539#(or (<= (+ j 1) N) (< i N)), 76542#(or (<= N j) (<= (+ 2 j) N)), 76551#(or (<= N i) (< (+ i 1) N) (<= (+ 3 j) N) (<= N (+ j 1))), 76538#(or (<= N (+ i 1)) (< (+ 2 i) N)), 76552#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 2 j) N)), 76544#(or (<= (+ 2 j) N) (< i N)), 76557#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 3 j) N) (<= N (+ j 1))), 76548#(or (<= (+ j 1) N) (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 21:54:38,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:54:38,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:54:38,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:54:38,376 INFO L87 Difference]: Start difference. First operand 4788 states and 21302 transitions. Second operand has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 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 21:54:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:39,524 INFO L93 Difference]: Finished difference Result 9443 states and 38806 transitions. [2022-03-15 21:54:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:54:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 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 21:54:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:39,559 INFO L225 Difference]: With dead ends: 9443 [2022-03-15 21:54:39,559 INFO L226 Difference]: Without dead ends: 9440 [2022-03-15 21:54:39,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1132, Invalid=3560, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:54:39,560 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 325 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:39,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 0 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:54:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9440 states. [2022-03-15 21:54:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9440 to 6423. [2022-03-15 21:54:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6423 states, 6422 states have (on average 4.47960137028963) internal successors, (28768), 6422 states have internal predecessors, (28768), 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 21:54:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 28768 transitions. [2022-03-15 21:54:39,810 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 28768 transitions. Word has length 19 [2022-03-15 21:54:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:39,810 INFO L470 AbstractCegarLoop]: Abstraction has 6423 states and 28768 transitions. [2022-03-15 21:54:39,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 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 21:54:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 28768 transitions. [2022-03-15 21:54:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:54:39,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:39,830 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:39,851 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 21:54:40,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:40,041 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1708854346, now seen corresponding path program 13 times [2022-03-15 21:54:40,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:40,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919544575] [2022-03-15 21:54:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 21:54:40,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:40,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919544575] [2022-03-15 21:54:40,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919544575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:40,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003211538] [2022-03-15 21:54:40,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:40,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:40,066 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 21:54:40,099 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 21:54:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:40,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:40,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 21:54:40,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 21:54:40,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003211538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:40,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:40,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-03-15 21:54:40,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570265391] [2022-03-15 21:54:40,175 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:40,176 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:40,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 297 transitions. [2022-03-15 21:54:40,191 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:41,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [99045#(or (<= N j) (<= (+ 2 j) N) (< k N)), 99051#(or (<= N (+ k 1)) (<= N j) (<= (+ 2 j) N)), 99038#(< k N), 99046#(or (<= N j) (<= (+ 2 j) N) (<= N k) (< (+ k 1) N)), 99041#(or (< k N) (< j N)), 99048#(or (<= (+ j 1) N) (<= N k)), 99052#(or (<= N j) (<= (+ j 1) k)), 99049#(or (<= N j) (<= (+ 2 j) N) (<= N k)), 99042#(or (<= N k) (< (+ k 1) N) (< j N)), 99039#(or (<= N k) (< (+ k 1) N)), 99043#(or (<= N (+ k 1)) (< (+ 2 k) N) (< j N)), 99047#(or (<= N (+ k 1)) (<= N j) (< (+ 2 k) N) (< (+ j 1) N)), 99040#(or (<= N (+ k 1)) (< (+ 2 k) N)), 99044#(or (<= N j) (<= (+ 2 j) N)), 99050#(or (<= N (+ k 1)) (<= (+ j 1) N))] [2022-03-15 21:54:41,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:54:41,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:54:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:54:41,974 INFO L87 Difference]: Start difference. First operand 6423 states and 28768 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 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 21:54:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:42,753 INFO L93 Difference]: Finished difference Result 21219 states and 86345 transitions. [2022-03-15 21:54:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:54:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 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 19 [2022-03-15 21:54:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:42,821 INFO L225 Difference]: With dead ends: 21219 [2022-03-15 21:54:42,821 INFO L226 Difference]: Without dead ends: 21164 [2022-03-15 21:54:42,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 126 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=539, Invalid=1441, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:54:42,822 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:42,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21164 states. [2022-03-15 21:54:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21164 to 13536. [2022-03-15 21:54:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13536 states, 13535 states have (on average 4.495973402290359) internal successors, (60853), 13535 states have internal predecessors, (60853), 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 21:54:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 60853 transitions. [2022-03-15 21:54:43,360 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 60853 transitions. Word has length 19 [2022-03-15 21:54:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:43,360 INFO L470 AbstractCegarLoop]: Abstraction has 13536 states and 60853 transitions. [2022-03-15 21:54:43,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 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 21:54:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 60853 transitions. [2022-03-15 21:54:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:54:43,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:43,403 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:43,426 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 21:54:43,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:43,619 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1571260986, now seen corresponding path program 14 times [2022-03-15 21:54:43,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:43,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540928931] [2022-03-15 21:54:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:43,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:43,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540928931] [2022-03-15 21:54:43,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540928931] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:43,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121353826] [2022-03-15 21:54:43,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:43,707 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 21:54:43,707 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 21:54:43,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:43,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:43,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:43,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 21:54:43,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 21:54:43,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121353826] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:43,821 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:43,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2022-03-15 21:54:43,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124010769] [2022-03-15 21:54:43,822 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:43,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:43,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 313 transitions. [2022-03-15 21:54:43,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:46,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 59 new interpolants: [147522#(or (<= N i) (< (+ i 1) N) (< j N)), 147531#(or (<= N i) (< (+ i 1) N) (<= (+ 3 N) k)), 147569#(or (<= N j) (<= N (+ 2 i)) (<= (+ 3 N) k) (< (+ 3 i) N) (< (+ j 1) N)), 147542#(or (< j N) (<= (+ 2 N) k)), 147532#(or (<= (+ N 4) k) (< j N)), 147517#(< i N), 147530#(or (<= (+ 3 N) k) (< i N)), 147546#(or (<= N j) (<= (+ 3 N) k) (< (+ j 1) N)), 147551#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 3 N) k) (< (+ j 1) N)), 147545#(or (<= N j) (<= (+ N 4) k) (< (+ j 1) N)), 147553#(or (<= N (+ i 1)) (<= N j) (<= (+ N 4) k) (< (+ 2 i) N) (< (+ j 1) N)), 147523#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j N)), 147570#(or (<= (* 2 N) (+ k i 1)) (< j N)), 147519#(or (< j N) (< i N)), 147537#(or (<= N i) (< (+ i 1) N) (<= (+ 3 N) k) (< j N)), 147564#(or (<= N j) (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ j 1) N)), 147558#(or (< (+ i 4) N) (<= N (+ 3 i))), 147555#(or (<= N j) (<= (* 2 N) (+ k i)) (< (+ j 1) N)), 147529#(or (<= (+ N 4) k) (<= N i) (< (+ i 1) N)), 147560#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< j N)), 147550#(or (<= N j) (<= (+ N 4) k) (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 147572#(or (<= N j) (<= (+ N 4) k) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ j 1) N)), 147526#(or (<= N j) (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 147565#(or (<= N j) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ j 1) N)), 147527#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (< (+ j 1) N)), 147562#(or (< (+ i 4) N) (<= N (+ 3 i)) (< j N)), 147571#(or (<= N j) (<= (* 2 N) (+ k i 1)) (< (+ j 1) N)), 147544#(or (<= (* 2 N) (+ k i)) (< j N)), 147536#(or (<= (+ N 4) k) (<= N i) (< (+ i 1) N) (< j N)), 147556#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 147557#(or (<= (+ N 4) k) (<= N (+ 2 i)) (< (+ 3 i) N)), 147533#(or (<= (+ 3 N) k) (< j N)), 147573#(or (< (+ i 4) N) (<= (+ 3 N) k) (<= N (+ 3 i))), 147574#(or (< (+ i 4) N) (<= (+ 3 N) k) (<= N (+ 3 i)) (< j N)), 147552#(or (<= N j) (<= (+ (* 2 N) 1) (+ k i)) (< (+ j 1) N)), 147563#(or (<= (+ N 4) k) (< (+ i 4) N) (<= N (+ 3 i)) (< j N)), 147561#(or (<= (+ N 4) k) (<= N (+ 2 i)) (< (+ 3 i) N) (< j N)), 147524#(or (<= N j) (< (+ j 1) N)), 147548#(or (<= N j) (<= (+ N 4) k) (< (+ j 1) N) (< i N)), 147567#(or (<= N (+ 2 i)) (<= (+ 3 N) k) (< (+ 3 i) N) (< j N)), 147528#(or (<= (+ N 4) k) (< i N)), 147538#(or (<= N (+ i 1)) (<= (+ N 4) k) (< (+ 2 i) N)), 147568#(or (<= N j) (<= (+ N 4) k) (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ j 1) N)), 147566#(or (<= N (+ 2 i)) (<= (+ 3 N) k) (< (+ 3 i) N)), 147541#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 N) k) (< j N)), 147518#(< j N), 147540#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 N) k)), 147559#(or (<= (+ N 4) k) (< (+ i 4) N) (<= N (+ 3 i))), 147534#(or (<= (+ N 4) k) (< j N) (< i N)), 147575#(or (<= N j) (< (+ i 4) N) (<= (+ 3 N) k) (<= N (+ 3 i)) (< (+ j 1) N)), 147520#(or (<= N i) (< (+ i 1) N)), 147549#(or (<= N j) (<= (+ 3 N) k) (< (+ j 1) N) (< i N)), 147543#(or (< j N) (<= (+ (* 2 N) 1) (+ k i))), 147525#(or (<= N j) (< (+ j 1) N) (< i N)), 147521#(or (<= N (+ i 1)) (< (+ 2 i) N)), 147539#(or (<= N (+ i 1)) (<= (+ N 4) k) (< (+ 2 i) N) (< j N)), 147535#(or (<= (+ 3 N) k) (< j N) (< i N)), 147554#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 3 N) k) (< (+ j 1) N)), 147547#(or (<= N j) (<= (+ 2 N) k) (< (+ j 1) N))] [2022-03-15 21:54:46,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 21:54:46,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 21:54:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=4838, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:54:46,988 INFO L87 Difference]: Start difference. First operand 13536 states and 60853 transitions. Second operand has 70 states, 70 states have (on average 3.1142857142857143) internal successors, (218), 69 states have internal predecessors, (218), 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 21:54:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:56,279 INFO L93 Difference]: Finished difference Result 31181 states and 127566 transitions. [2022-03-15 21:54:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 21:54:56,280 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 3.1142857142857143) internal successors, (218), 69 states have internal predecessors, (218), 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 21:54:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:56,401 INFO L225 Difference]: With dead ends: 31181 [2022-03-15 21:54:56,401 INFO L226 Difference]: Without dead ends: 31096 [2022-03-15 21:54:56,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14828 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9386, Invalid=41916, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 21:54:56,406 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 967 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:56,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [967 Valid, 0 Invalid, 4289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 3851 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:54:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31096 states. [2022-03-15 21:54:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31096 to 13797. [2022-03-15 21:54:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13797 states, 13796 states have (on average 4.482168744563642) internal successors, (61836), 13796 states have internal predecessors, (61836), 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 21:54:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13797 states to 13797 states and 61836 transitions. [2022-03-15 21:54:57,017 INFO L78 Accepts]: Start accepts. Automaton has 13797 states and 61836 transitions. Word has length 19 [2022-03-15 21:54:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:57,017 INFO L470 AbstractCegarLoop]: Abstraction has 13797 states and 61836 transitions. [2022-03-15 21:54:57,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.1142857142857143) internal successors, (218), 69 states have internal predecessors, (218), 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 21:54:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 13797 states and 61836 transitions. [2022-03-15 21:54:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:54:57,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:57,064 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:57,081 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 21:54:57,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:57,270 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1625606872, now seen corresponding path program 15 times [2022-03-15 21:54:57,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:57,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499591600] [2022-03-15 21:54:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:57,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:57,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499591600] [2022-03-15 21:54:57,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499591600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:57,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389394009] [2022-03-15 21:54:57,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:57,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:57,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:57,576 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 21:54:57,578 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 21:54:57,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:54:57,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:57,610 WARN L261 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 21:54:57,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:58,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-03-15 21:54:58,147 INFO L353 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-03-15 21:54:58,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 141 [2022-03-15 21:54:58,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:58,298 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 70 treesize of output 96 [2022-03-15 21:54:58,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:58,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 195 [2022-03-15 21:54:58,347 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 156 treesize of output 124 [2022-03-15 21:55:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:02,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:02,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:02,987 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:55:02,987 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 5 new quantified variables, introduced 14 case distinctions, treesize of input 80 treesize of output 117 [2022-03-15 21:55:03,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:03,759 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:55:03,760 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 5 new quantified variables, introduced 14 case distinctions, treesize of input 61 treesize of output 98 [2022-03-15 21:55:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:03,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389394009] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:03,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:03,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 34 [2022-03-15 21:55:03,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639609553] [2022-03-15 21:55:03,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:03,977 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:03,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 452 transitions. [2022-03-15 21:55:03,997 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:24,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 103 new interpolants: [206846#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) asum bsum (select A (+ i 1))) csum)) (or (< csum (+ (select A i) asum bsum (select A (+ i 1)) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 206894#(and (or (<= N (+ 2 j)) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) csum) (< (+ 3 i) N)) (or (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ 2 j)) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206812#(and (or (<= (+ 2 k) N) (< i N) (<= (+ csum (select A k) (select B k)) (+ asum bsum))) (or (<= (+ 2 k) N) (< i N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 206887#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (< (+ 3 i) N) (<= (+ k 4) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))))) (or (= (+ j 1) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206829#(and (or (<= N j) (<= (+ 2 k) N) (<= (+ asum bsum (select B j)) (+ csum (select A k) (select B k))) (< i N)) (or (<= N j) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 2 k) N) (< i N))), 206903#(and (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))))) (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) (+ csum (select A k) (select B k))))), 206845#(and (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ j 1)))), 206860#(and (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1)) 1)))), 206827#(and (or (<= N j) (< (+ 2 k) N) (<= (+ (select B (+ (- 1) N)) csum (select A k) (select B k) (select A (+ (- 1) N))) (+ asum bsum (select B j)))) (or (<= N j) (<= (+ 2 k) N)) (or (<= N j) (< (+ 2 k) N) (<= (+ asum bsum (select B j)) (+ (select B (+ (- 1) N)) csum (select A k) (select B k) (select A (+ (- 1) N)))))), 206823#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (<= N (+ j 1)) (< i N)) (or (<= N (+ j 1)) (< i N) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 206866#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 206855#(and (or (<= N j) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) 1))) (or (<= N j) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))) csum) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N))), 206825#(and (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< k N)) (or (<= N j) (< k N) (< csum (+ asum bsum (select B j) 1)))), 206847#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1))) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) csum))), 206883#(and (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (< (+ 3 i) N) (<= N (+ j 1))) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ j 1)) (<= (+ csum (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))))), 206838#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 206811#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ csum (select A k) (select B k)) (+ asum bsum 1)) (< i N)) (or (not (< k N)) (<= (+ 2 k) N) (< i N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 206849#(and (or (< k N) (<= N (+ j 1)) (< i N) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1))))) (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (< k N) (<= N (+ j 1)) (< i N))), 206871#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1))))) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) (+ csum (select A k) (select B k))))), 206842#(and (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (= (+ j 1) N) (not (< i N)) (< (+ 3 k) N)) (or (< (+ i 1) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j))) (not (< i N)) (<= (+ k 4) N)) (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< i N)) (<= (+ k 4) N))), 206888#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1)))) (<= (+ k 4) N) (< i N)) (or (= (+ 2 j) N) (< (+ 3 k) N) (< i N)) (or (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ k 4) N) (< i N)) (or (<= (+ 3 k) N) (< i N))), 206889#(and (or (< (+ i 1) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ j 1)))) (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) asum bsum (select B j) (select B (+ j 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (= (+ 2 j) N) (< (+ i 1) N) (not (< i N)) (< (+ 3 k) N))), 206830#(and (or (<= N j) (<= (+ 3 k) N) (<= (+ asum bsum (select B j)) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (<= N j) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 3 k) N) (< i N)) (or (<= N j) (<= (+ 2 k) N) (< i N))), 206854#(and (or (<= N j) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))) csum) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= N j) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) 1)))), 206826#(and (or (<= N j) (<= (+ 2 k) N) (<= (+ asum bsum (select B j)) (+ csum (select A k) (select B k)))) (or (<= N j) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ 2 k) N))), 206905#(and (or (<= N (+ 2 j)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1)))) (< i N)) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (< i N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= N (+ 2 j)) (<= (+ 2 k) N) (< i N))), 206906#(and (or (<= N (+ 2 j)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))))) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< i N)))), 206817#(and (or (<= (+ k 4) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< i N)) (or (<= (+ k 4) N) (<= (+ asum bsum) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (<= (+ 3 k) N) (< i N))), 206808#(and (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (not (< (+ k 1) N))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)))), 206907#(and (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1)))))), 206824#(and (or (< csum (+ (select A i) asum bsum (select B j) 1 (select B (+ j 1)))) (< (+ i 1) N) (not (< i N)) (<= N (+ j 1))) (or (< (+ i 1) N) (not (< i N)) (<= N (+ j 1)) (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) csum))), 206878#(and (or (<= (+ 3 k) N) (<= N (+ j 1)) (< i N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1))))) (or (<= (+ 2 k) N) (<= N (+ j 1)) (< i N)) (or (<= (+ 3 k) N) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= N (+ j 1)) (< i N))), 206864#(and (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 3 k) N) (< (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)) 1)))), 206858#(and (or (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1))) (or (<= (+ 2 k) N) (<= N (+ j 1)) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1)))))), 206867#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1))))) (or (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N))), 206861#(and (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 3 k) N) (< (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1)) 1))) (or (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 3 k) N))), 206876#(and (or (<= N j) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= N j) (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))))) (or (<= N j) (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 206868#(and (or (<= (+ 2 k) N) (<= N (+ j 1))) (or (< (+ 2 k) N) (<= N (+ j 1)) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ (select B (+ (- 1) N)) csum (select A k) (select B k) (select A (+ (- 1) N))))) (or (<= (+ (select B (+ (- 1) N)) csum (select A k) (select B k) (select A (+ (- 1) N))) (+ asum bsum (select B j) (select B (+ j 1)))) (< (+ 2 k) N) (<= N (+ j 1)))), 206892#(and (or (<= N (+ 2 j)) (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1))))) (or (<= N (+ 2 j)) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum))), 206832#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) asum bsum) csum)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) asum bsum 1)))), 206807#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ csum (select A k) (select B k)) (+ asum bsum 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 206837#(and (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A i) asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum 1)))), 206884#(and (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= N (+ j 1))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ j 1))) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ j 1)))), 206880#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= N (+ j 1))) (or (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ j 1)))) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= N (+ j 1))) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= N (+ j 1)))), 206869#(and (or (<= N (+ 2 j)) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum)) (or (<= N (+ 2 j)) (< csum (+ asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1)))))), 206881#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= N (+ j 1)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))))), 206896#(and (or (<= N (+ 2 j)) (< k N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum) (< i N)) (or (<= N (+ 2 j)) (< csum (+ asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1)))) (< k N) (< i N))), 206818#(and (or (<= N j) (< csum (+ asum bsum (select B j) 1))) (or (<= (+ asum bsum (select B j)) csum) (<= N j))), 206843#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) csum)) (or (< csum (+ (select A i) asum bsum (select A (+ i 1)) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N))), 206848#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (< k N) (<= N (+ j 1))) (or (< k N) (<= N (+ j 1)) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 206828#(and (or (<= N j) (< k N) (< csum (+ asum bsum (select B j) 1)) (< i N)) (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< k N) (< i N))), 206902#(and (or (<= N (+ 2 j)) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= N (+ 2 j)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1)))))), 206816#(and (or (not (< (+ 2 k) N)) (<= (+ k 4) N) (<= (+ asum bsum) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (not (< (+ 2 k) N)) (< (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)) (<= (+ k 4) N) (< i N))), 206891#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (< (+ 3 i) N) (<= (+ k 4) N)) (or (= (+ 2 j) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N))), 206822#(and (or (<= (+ asum bsum (select B j) (select B (+ j 1))) csum) (<= N (+ j 1))) (or (<= N (+ j 1)) (< csum (+ asum bsum (select B j) 1 (select B (+ j 1)))))), 206813#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)) (< i N)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (not (< (+ k 1) N)) (< i N))), 206839#(and (or (<= N j) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= N j) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B j)) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= N j) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j))))), 206885#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206895#(and (or (<= N (+ 2 j)) (< csum (+ asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1)))) (< k N)) (or (<= N (+ 2 j)) (< k N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum))), 206872#(and (or (<= N j) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= N j) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1))))) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 206831#(and (or (= (+ j 1) N) (< (+ 3 k) N) (< i N)) (or (<= (+ asum bsum (select B j)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ k 4) N) (< i N)) (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j))) (<= (+ k 4) N) (< i N)) (or (<= (+ 3 k) N) (< i N))), 206851#(and (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (< k N) (<= N (+ j 1)))), 206821#(and (or (<= N j) (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B j) 1))) (or (<= N j) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j)) csum) (not (< i N)))), 206809#(and (or (< i N) (< csum (+ asum bsum 1))) (or (<= (+ asum bsum) csum) (< i N))), 206875#(and (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206893#(and (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) 1 (select B (+ j 1))))) (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) csum))), 206898#(and (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) csum)) (or (<= N (+ 2 j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) 1 (select B (+ j 1)))))), 206901#(and (or (<= N (+ 2 j)) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1)))) (< i N)) (or (<= N (+ 2 j)) (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (< i N))), 206886#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1)))) (<= (+ k 4) N)) (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N)) (or (not (< (+ i 1) N)) (= (+ j 1) N) (< (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N))), 206882#(and (or (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= N (+ j 1))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))) (<= N (+ j 1)))), 206836#(and (or (<= N j) (<= (+ (select A i) asum bsum (select B j)) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= N j) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j))))), 206879#(and (or (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= N (+ j 1))) (or (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select B (+ j 1)))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= N (+ j 1)))), 206819#(and (or (<= (+ asum bsum (select B j)) csum) (<= N j) (< i N)) (or (<= N j) (< csum (+ asum bsum (select B j) 1)) (< i N))), 206833#(and (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum 1))) (or (not (< k N)) (<= (+ (select A i) asum bsum) (+ csum (select A k) (select B k))) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N))), 206852#(and (or (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) csum) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206904#(and (or (<= N (+ 2 j)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))))) (or (<= N (+ 2 j)) (<= (+ 2 k) N)) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))))), 206840#(and (or (not (< (+ 2 k) N)) (< (+ i 1) N) (not (< i N)) (< (+ 3 k) N) (< (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum 1))) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (not (< i N)) (< (+ 3 k) N) (<= (+ (select A i) asum bsum) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))))), 206908#(and (or (<= N (+ 2 j)) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))))) (or (<= N (+ 2 j)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206900#(and (or (<= N (+ 2 j)) (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) (+ csum (select A k) (select B k)))) (or (<= N (+ 2 j)) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1)))))), 206890#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ k 4) N)) (or (= (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 3 k) N)) (or (not (< (+ i 1) N)) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1)))) (< (+ 2 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N))), 206841#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum)) (<= (+ 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) asum bsum) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))))), 206814#(and (or (<= (+ 2 k) N) (< i N)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (<= (+ 3 k) N) (< i N)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< i N))), 206877#(and (or (<= (+ 2 k) N) (<= N (+ j 1)) (< i N) (<= (+ csum (select A k) (select B k)) (+ asum bsum (select B j) (select B (+ j 1))))) (or (<= (+ 2 k) N) (<= (+ asum bsum (select B j) (select B (+ j 1))) (+ csum (select A k) (select B k))) (<= N (+ j 1)) (< i N))), 206856#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ j 1)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ j 1)))), 206874#(and (or (<= (+ csum (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)))) (<= N j) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= N j) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1))) (+ csum (select A k) (select B k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 206853#(and (or (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) csum) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N))), 206862#(and (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k))) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (< (+ csum (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)) 1)))), 206815#(and (or (not (< (+ 2 k) N)) (< (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum 1)) (<= (+ k 4) N)) (or (not (< (+ 2 k) N)) (<= (+ k 4) N) (<= (+ asum bsum) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) csum (select B (+ k 1)) (select A k) (select B k))))), 206810#(and (or (< k N) (< i N) (< csum (+ asum bsum 1))) (or (< k N) (<= (+ asum bsum) csum) (< i N))), 206820#(and (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum 1))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum) csum))), 206870#(and (or (<= N (+ 2 j)) (< csum (+ asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1)))) (< i N)) (or (<= N (+ 2 j)) (<= (+ asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum) (< i N))), 206857#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ j 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= N (+ j 1)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select A (+ i 1)) (select B (+ j 1))) csum))), 206897#(and (or (<= N (+ 2 j)) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) (select B (+ j 1))) csum) (< k N)) (or (<= N (+ 2 j)) (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) asum bsum (select B j) (select B (+ 2 j)) 1 (select B (+ j 1)))))), 206873#(and (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k)))) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)))))), 206899#(and (or (<= N (+ 2 j)) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) csum) (< (+ 3 i) N) (< k N)) (or (< csum (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) 1 (select B (+ j 1)))) (<= N (+ 2 j)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N))), 206863#(and (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (< (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select A (+ i 1)) 1)) (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N))), 206909#(and (or (<= N (+ 2 j)) (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1))) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)))) (or (<= N (+ 2 j)) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= N (+ 2 j)) (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) asum bsum (select B j) (select B (+ 2 j)) (select A (+ i 1)) (select B (+ j 1)))))), 206859#(and (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1)) 1))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k))) (< (+ k 1) N))), 206850#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= N (+ j 1)) (<= (+ (select A i) asum bsum (select B j) (select B (+ j 1))) csum)) (or (< csum (+ (select A i) asum bsum (select B j) 1 (select B (+ j 1)))) (< (+ i 1) N) (not (< i N)) (< k N) (<= N (+ j 1)))), 206835#(and (or (<= N j) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B j)) csum) (not (< i N)) (< k N)) (or (<= N j) (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) asum bsum (select B j) 1)))), 206834#(and (or (<= (+ (select A i) asum bsum) (+ csum (select A k) (select B k))) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum)))), 206865#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) asum bsum (select A (+ i 1))) (+ csum (select A k) (select B k))))), 206844#(and (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) asum bsum (select B j) (select A (+ i 1))) csum)) (or (<= N j) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) asum bsum (select B j) (select A (+ i 1)) 1))))] [2022-03-15 21:55:24,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-03-15 21:55:24,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-03-15 21:55:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=17637, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 21:55:24,018 INFO L87 Difference]: Start difference. First operand 13797 states and 61836 transitions. Second operand has 116 states, 115 states have (on average 3.017391304347826) internal successors, (347), 115 states have internal predecessors, (347), 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:03:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 725 states. [2022-03-15 22:03:37,251 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:03:37,253 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:03:37,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 56 SyntacticMatches, 24 SemanticMatches, 859 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312500 ImplicationChecksByTransitivity, 491.5s TimeCoverageRelationStatistics Valid=99559, Invalid=640901, Unknown=0, NotChecked=0, Total=740460 [2022-03-15 22:03:37,269 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3617 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 11168 mSolverCounterSat, 4761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4761 IncrementalHoareTripleChecker+Valid, 11168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:37,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3617 Valid, 0 Invalid, 15929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4761 Valid, 11168 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-03-15 22:03:37,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:03:37,286 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:03:37,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:37,474 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (13797states) and FLOYD_HOARE automaton (currently 725 states, 116 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 861 known predicates. [2022-03-15 22:03:37,475 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:03:37,475 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:03:37,475 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:03:37,477 INFO L732 BasicCegarLoop]: Path program histogram: [15, 2, 2, 1, 1, 1] [2022-03-15 22:03:37,479 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:03:37,479 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:03:37,480 INFO L202 PluginConnector]: Adding new model three-array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:03:37 BasicIcfg [2022-03-15 22:03:37,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:03:37,481 INFO L158 Benchmark]: Toolchain (without parser) took 743934.71ms. Allocated memory was 175.1MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 142.9MB in the beginning and 559.2MB in the end (delta: -416.3MB). Peak memory consumption was 507.2MB. Max. memory is 8.0GB. [2022-03-15 22:03:37,481 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 175.1MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:03:37,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.70ms. Allocated memory is still 175.1MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:03:37,481 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 175.1MB. Free memory was 141.2MB in the beginning and 140.3MB in the end (delta: 849.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:03:37,481 INFO L158 Benchmark]: RCFGBuilder took 199.83ms. Allocated memory is still 175.1MB. Free memory was 140.1MB in the beginning and 130.5MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:03:37,482 INFO L158 Benchmark]: TraceAbstraction took 743664.40ms. Allocated memory was 175.1MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 130.1MB in the beginning and 559.2MB in the end (delta: -429.0MB). Peak memory consumption was 494.6MB. Max. memory is 8.0GB. [2022-03-15 22:03:37,482 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.15ms. Allocated memory is still 175.1MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.70ms. Allocated memory is still 175.1MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 175.1MB. Free memory was 141.2MB in the beginning and 140.3MB in the end (delta: 849.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 199.83ms. Allocated memory is still 175.1MB. Free memory was 140.1MB in the beginning and 130.5MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 743664.40ms. Allocated memory was 175.1MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 130.1MB in the beginning and 559.2MB in the end (delta: -429.0MB). Peak memory consumption was 494.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 34 PlacesBefore, 25 PlacesAfterwards, 27 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 96, positive conditional: 0, positive unconditional: 96, 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: 63, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 96, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 63, unknown conditional: 0, unknown unconditional: 63] , 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: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (13797states) and FLOYD_HOARE automaton (currently 725 states, 116 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 861 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 (13797states) and FLOYD_HOARE automaton (currently 725 states, 116 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 861 known predicates. - TimeoutResultAtElement [Line: 60]: 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 (13797states) and FLOYD_HOARE automaton (currently 725 states, 116 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 861 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 (13797states) and FLOYD_HOARE automaton (currently 725 states, 116 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 861 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 743.6s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.2s, AutomataDifference: 681.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10981 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10981 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5253 mSDsCounter, 7494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27880 IncrementalHoareTripleChecker+Invalid, 35374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7494 mSolverCounterUnsat, 0 mSDtfsCounter, 27880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3965 GetRequests, 1497 SyntacticMatches, 88 SemanticMatches, 2379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552259 ImplicationChecksByTransitivity, 672.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13797occurred in iteration=21, InterpolantAutomatonStates: 1232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 45306 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 624 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 849 ConstructedInterpolants, 18 QuantifiedInterpolants, 6319 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 56 InterpolantComputations, 5 PerfectInterpolantSequences, 281/498 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