/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:53:40,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:53:40,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:53:40,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:53:40,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:53:40,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:53:40,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:53:40,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:53:40,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:53:40,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:53:40,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:53:40,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:53:40,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:53:40,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:53:40,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:53:40,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:53:40,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:53:40,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:53:40,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:53:40,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:53:40,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:53:40,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:53:40,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:53:40,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:53:40,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:53:40,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:53:40,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:53:40,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:53:40,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:53:40,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:53:40,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:53:40,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:53:40,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:53:40,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:53:40,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:53:40,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:53:40,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:53:40,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:53:40,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:53:40,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:53:40,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:53:40,206 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:53:40,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:53:40,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:53:40,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:53:40,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:53:40,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:53:40,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:53:40,241 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:53:40,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:53:40,242 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:53:40,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:53:40,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:53:40,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:53:40,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:53:40,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:53:40,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:53:40,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:53:40,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:53:40,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:53:40,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:53:40,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:53:40,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:53:40,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:53:40,247 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:53:40,248 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:53:40,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:53:40,248 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:53:40,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:53:40,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:53:40,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:53:40,470 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:53:40,471 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:53:40,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series-array.wvr.bpl [2022-03-15 21:53:40,472 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series-array.wvr.bpl' [2022-03-15 21:53:40,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:53:40,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:53:40,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:53:40,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:53:40,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:53:40,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,522 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:53:40,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:53:40,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:53:40,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:53:40,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:53:40,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:53:40,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:53:40,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:53:40,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:53:40,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/1) ... [2022-03-15 21:53:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:53:40,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:40,573 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:53:40,587 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:53:40,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:53:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:53:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:53:40,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:53:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:53:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:53:40,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:53:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:53:40,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:53:40,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:53:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:53:40,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:53:40,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:53:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:53:40,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:53:40,626 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:53:40,668 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:53:40,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:53:40,808 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:53:40,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:53:40,825 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:53:40,827 INFO L202 PluginConnector]: Adding new model buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:53:40 BoogieIcfgContainer [2022-03-15 21:53:40,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:53:40,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:53:40,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:53:40,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:53:40,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:40" (1/2) ... [2022-03-15 21:53:40,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112b7cce and model type buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:53:40, skipping insertion in model container [2022-03-15 21:53:40,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:53:40" (2/2) ... [2022-03-15 21:53:40,842 INFO L111 eAbstractionObserver]: Analyzing ICFG buffer-series-array.wvr.bpl [2022-03-15 21:53:40,847 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:53:40,847 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:53:40,847 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:53:40,847 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:53:40,923 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 21:53:41,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:53:41,023 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:53:41,024 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 21:53:41,035 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:53:41,043 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:41,046 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:41,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:41,069 INFO L129 PetriNetUnfolder]: 4/31 cut-off events. [2022-03-15 21:53:41,069 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 21:53:41,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 53 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2022-03-15 21:53:41,074 INFO L116 LiptonReduction]: Number of co-enabled transitions 350 [2022-03-15 21:53:41,208 INFO L131 LiptonReduction]: Checked pairs total: 559 [2022-03-15 21:53:41,208 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 21:53:41,215 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2022-03-15 21:53:41,265 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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:53:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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:53:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:53:41,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:41,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:41,277 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1791700969, now seen corresponding path program 1 times [2022-03-15 21:53:41,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:41,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491171736] [2022-03-15 21:53:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:41,418 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:53:41,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:41,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491171736] [2022-03-15 21:53:41,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491171736] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:41,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:41,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:53:41,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890942317] [2022-03-15 21:53:41,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:41,425 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:41,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 21:53:41,484 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:42,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:42,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:53:42,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:42,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:53:42,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:53:42,139 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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:53:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:42,182 INFO L93 Difference]: Finished difference Result 311 states and 1184 transitions. [2022-03-15 21:53:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:53:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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:53:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:42,195 INFO L225 Difference]: With dead ends: 311 [2022-03-15 21:53:42,195 INFO L226 Difference]: Without dead ends: 296 [2022-03-15 21:53:42,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:53:42,199 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:42,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-03-15 21:53:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 221. [2022-03-15 21:53:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.8045454545454547) internal successors, (837), 220 states have internal predecessors, (837), 0 states have call successors, (0), 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:53:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 837 transitions. [2022-03-15 21:53:42,268 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 837 transitions. Word has length 14 [2022-03-15 21:53:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:42,268 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 837 transitions. [2022-03-15 21:53:42,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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:53:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 837 transitions. [2022-03-15 21:53:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:42,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:42,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:42,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:53:42,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash -237980391, now seen corresponding path program 1 times [2022-03-15 21:53:42,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:42,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489359785] [2022-03-15 21:53:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:42,318 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:53:42,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:42,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489359785] [2022-03-15 21:53:42,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489359785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:42,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:42,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:42,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142592215] [2022-03-15 21:53:42,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:42,326 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:42,340 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 196 transitions. [2022-03-15 21:53:42,341 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:43,525 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1134#(or (< q1_front q1_back) (< i N)), 1135#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 1136#(or (= q1_front q1_back) (< i N)), 1133#(< i N)] [2022-03-15 21:53:43,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:53:43,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:53:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:53:43,527 INFO L87 Difference]: Start difference. First operand 221 states and 837 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:53:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:43,671 INFO L93 Difference]: Finished difference Result 443 states and 1536 transitions. [2022-03-15 21:53:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:53:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:53:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:43,678 INFO L225 Difference]: With dead ends: 443 [2022-03-15 21:53:43,678 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 21:53:43,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:53:43,680 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:43,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 15 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 21:53:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 305. [2022-03-15 21:53:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.713815789473684) internal successors, (1129), 304 states have internal predecessors, (1129), 0 states have call successors, (0), 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:53:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 1129 transitions. [2022-03-15 21:53:43,716 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 1129 transitions. Word has length 16 [2022-03-15 21:53:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:43,717 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 1129 transitions. [2022-03-15 21:53:43,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:53:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 1129 transitions. [2022-03-15 21:53:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:43,729 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:43,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:43,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:53:43,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash 436556309, now seen corresponding path program 1 times [2022-03-15 21:53:43,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:43,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117781148] [2022-03-15 21:53:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:43,789 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:53:43,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:43,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117781148] [2022-03-15 21:53:43,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117781148] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:43,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:43,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:43,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1129065710] [2022-03-15 21:53:43,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:43,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:43,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 176 transitions. [2022-03-15 21:53:43,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:44,419 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2196#(< j N), 2197#(or (< j N) (= q2_back q2_front))] [2022-03-15 21:53:44,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:53:44,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:53:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:53:44,421 INFO L87 Difference]: Start difference. First operand 305 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 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:53:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:44,525 INFO L93 Difference]: Finished difference Result 471 states and 1653 transitions. [2022-03-15 21:53:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:53:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 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 16 [2022-03-15 21:53:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:44,529 INFO L225 Difference]: With dead ends: 471 [2022-03-15 21:53:44,529 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 21:53:44,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:53:44,532 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:44,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 21:53:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 430. [2022-03-15 21:53:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.6386946386946386) internal successors, (1561), 429 states have internal predecessors, (1561), 0 states have call successors, (0), 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:53:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1561 transitions. [2022-03-15 21:53:44,550 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1561 transitions. Word has length 16 [2022-03-15 21:53:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:44,550 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 1561 transitions. [2022-03-15 21:53:44,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 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:53:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1561 transitions. [2022-03-15 21:53:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:53:44,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:44,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:44,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:53:44,554 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1538419362, now seen corresponding path program 1 times [2022-03-15 21:53:44,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:44,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156851239] [2022-03-15 21:53:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:44,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:44,602 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:53:44,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:44,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156851239] [2022-03-15 21:53:44,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156851239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:44,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990726736] [2022-03-15 21:53:44,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:44,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:44,607 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:53:44,611 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:53:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:44,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:53:44,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:44,767 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:53:44,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:44,817 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:53:44,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990726736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:44,818 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:44,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:53:44,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015200065] [2022-03-15 21:53:44,818 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:44,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:44,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 236 transitions. [2022-03-15 21:53:44,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:45,310 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 8 treesize of output 6 [2022-03-15 21:53:45,450 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 8 treesize of output 6 [2022-03-15 21:53:46,023 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3639#(< i N), 3642#(or (<= N i) (< (+ i 1) N)), 3641#(< (+ i 1) N), 3643#(or (<= (+ j 1) N) (< (+ i 1) N)), 3640#(or (<= (+ j 1) N) (< i N)), 3644#(or (<= N i) (< (+ i 1) N) (< j N))] [2022-03-15 21:53:46,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:53:46,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:53:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:53:46,025 INFO L87 Difference]: Start difference. First operand 430 states and 1561 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:53:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:46,367 INFO L93 Difference]: Finished difference Result 702 states and 2285 transitions. [2022-03-15 21:53:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:53:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:53:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:46,372 INFO L225 Difference]: With dead ends: 702 [2022-03-15 21:53:46,372 INFO L226 Difference]: Without dead ends: 621 [2022-03-15 21:53:46,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 20 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:53:46,373 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:46,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 1 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-03-15 21:53:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 501. [2022-03-15 21:53:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 3.466) internal successors, (1733), 500 states have internal predecessors, (1733), 0 states have call successors, (0), 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:53:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1733 transitions. [2022-03-15 21:53:46,392 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1733 transitions. Word has length 18 [2022-03-15 21:53:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:46,392 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 1733 transitions. [2022-03-15 21:53:46,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:53:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1733 transitions. [2022-03-15 21:53:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:53:46,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:46,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:46,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:46,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:46,608 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2081986343, now seen corresponding path program 1 times [2022-03-15 21:53:46,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:46,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746797569] [2022-03-15 21:53:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:46,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:46,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746797569] [2022-03-15 21:53:46,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746797569] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:46,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:46,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:46,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1659566378] [2022-03-15 21:53:46,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:46,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:46,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 195 transitions. [2022-03-15 21:53:46,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:47,184 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 10 treesize of output 8 [2022-03-15 21:53:47,252 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:53:47,281 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:53:47,326 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 10 treesize of output 8 [2022-03-15 21:53:47,362 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5372#(or (<= N j) (< i N)), 5369#(< j N), 5370#(< i N), 5371#(or (< j N) (< i N))] [2022-03-15 21:53:47,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:53:47,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:53:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:53:47,363 INFO L87 Difference]: Start difference. First operand 501 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:47,549 INFO L93 Difference]: Finished difference Result 547 states and 1818 transitions. [2022-03-15 21:53:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:53:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:53:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:47,552 INFO L225 Difference]: With dead ends: 547 [2022-03-15 21:53:47,552 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:53:47,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:53:47,553 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:47,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:53:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 412. [2022-03-15 21:53:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.435523114355231) internal successors, (1412), 411 states have internal predecessors, (1412), 0 states have call successors, (0), 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:53:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1412 transitions. [2022-03-15 21:53:47,567 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1412 transitions. Word has length 18 [2022-03-15 21:53:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:47,568 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1412 transitions. [2022-03-15 21:53:47,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1412 transitions. [2022-03-15 21:53:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:47,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:47,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:47,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:53:47,570 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:47,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1057526178, now seen corresponding path program 1 times [2022-03-15 21:53:47,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:47,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217116459] [2022-03-15 21:53:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:53:47,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:47,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217116459] [2022-03-15 21:53:47,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217116459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:47,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702823493] [2022-03-15 21:53:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:47,604 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:53:47,636 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:53:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:47,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:53:47,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:53:47,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:53:47,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702823493] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:47,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:53:47,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:53:47,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071309118] [2022-03-15 21:53:47,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:47,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:47,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 388 transitions. [2022-03-15 21:53:47,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:48,205 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 9 treesize of output 7 [2022-03-15 21:53:48,811 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 9 treesize of output 7 [2022-03-15 21:53:48,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:48,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:53:48,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:53:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:48,941 INFO L87 Difference]: Start difference. First operand 412 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:53:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:48,979 INFO L93 Difference]: Finished difference Result 532 states and 1840 transitions. [2022-03-15 21:53:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:53:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 20 [2022-03-15 21:53:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:48,983 INFO L225 Difference]: With dead ends: 532 [2022-03-15 21:53:48,983 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:53:48,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:48,984 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:48,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:53:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 362. [2022-03-15 21:53:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.409972299168975) internal successors, (1231), 361 states have internal predecessors, (1231), 0 states have call successors, (0), 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:53:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1231 transitions. [2022-03-15 21:53:48,997 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1231 transitions. Word has length 20 [2022-03-15 21:53:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:48,997 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 1231 transitions. [2022-03-15 21:53:48,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:53:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1231 transitions. [2022-03-15 21:53:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:48,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:48,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:49,025 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:53:49,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 21:53:49,216 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354338, now seen corresponding path program 1 times [2022-03-15 21:53:49,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:49,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916234766] [2022-03-15 21:53:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:49,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:49,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916234766] [2022-03-15 21:53:49,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916234766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:49,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574876501] [2022-03-15 21:53:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:49,245 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:53:49,273 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:53:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:49,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:53:49,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:49,320 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:53:49,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:53:49,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574876501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:49,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:53:49,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:53:49,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1954120201] [2022-03-15 21:53:49,321 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:49,323 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:49,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 263 transitions. [2022-03-15 21:53:49,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:50,037 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 8 treesize of output 6 [2022-03-15 21:53:50,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:50,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:53:50,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:53:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:50,216 INFO L87 Difference]: Start difference. First operand 362 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:53:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:50,269 INFO L93 Difference]: Finished difference Result 540 states and 1842 transitions. [2022-03-15 21:53:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:53:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 20 [2022-03-15 21:53:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:50,273 INFO L225 Difference]: With dead ends: 540 [2022-03-15 21:53:50,273 INFO L226 Difference]: Without dead ends: 540 [2022-03-15 21:53:50,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:50,274 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:50,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-03-15 21:53:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 423. [2022-03-15 21:53:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.5) internal successors, (1477), 422 states have internal predecessors, (1477), 0 states have call successors, (0), 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:53:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1477 transitions. [2022-03-15 21:53:50,288 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1477 transitions. Word has length 20 [2022-03-15 21:53:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:50,288 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1477 transitions. [2022-03-15 21:53:50,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:53:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1477 transitions. [2022-03-15 21:53:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:50,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:50,290 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:50,317 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:53:50,512 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:53:50,513 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash -325286663, now seen corresponding path program 2 times [2022-03-15 21:53:50,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:50,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149863118] [2022-03-15 21:53:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:53:50,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:50,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149863118] [2022-03-15 21:53:50,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149863118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:50,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:50,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:50,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114707281] [2022-03-15 21:53:50,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:50,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:50,561 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 224 transitions. [2022-03-15 21:53:50,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:51,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [9527#(<= q1_back q1_front), 9530#(and (or (not (< i N)) (< j N)) (or (< j N) (not (< q1_front q1_back)))), 9529#(and (not (< i N)) (not (< q1_front q1_back))), 9531#(and (or (= (+ (* (- 1) q1_front) q1_back) 0) (< j N)) (or (<= N i) (< j N))), 9528#(or (< j N) (<= q1_back q1_front)), 9524#(< j N), 9526#(or (< j N) (< i N)), 9525#(< i N)] [2022-03-15 21:53:51,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:53:51,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:53:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:53:51,304 INFO L87 Difference]: Start difference. First operand 423 states and 1477 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:51,540 INFO L93 Difference]: Finished difference Result 335 states and 1191 transitions. [2022-03-15 21:53:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:53:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:53:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:51,542 INFO L225 Difference]: With dead ends: 335 [2022-03-15 21:53:51,543 INFO L226 Difference]: Without dead ends: 330 [2022-03-15 21:53:51,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:53:51,543 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:51,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-03-15 21:53:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 317. [2022-03-15 21:53:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.607594936708861) internal successors, (1140), 316 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1140 transitions. [2022-03-15 21:53:51,552 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1140 transitions. Word has length 20 [2022-03-15 21:53:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:51,552 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1140 transitions. [2022-03-15 21:53:51,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1140 transitions. [2022-03-15 21:53:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:53:51,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:51,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:51,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:53:51,554 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 552255584, now seen corresponding path program 1 times [2022-03-15 21:53:51,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:51,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47169058] [2022-03-15 21:53:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:51,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:51,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47169058] [2022-03-15 21:53:51,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47169058] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:51,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686492370] [2022-03-15 21:53:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:51,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:51,702 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:53:51,703 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:53:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:51,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:53:51,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:51,822 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 16 treesize of output 12 [2022-03-15 21:53:51,849 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 14 treesize of output 10 [2022-03-15 21:53:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:51,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:51,987 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:51,988 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 32 treesize of output 34 [2022-03-15 21:53:52,057 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:52,057 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 31 treesize of output 33 [2022-03-15 21:53:52,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:52,072 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 29 treesize of output 31 [2022-03-15 21:53:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:52,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686492370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:52,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:52,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 21:53:52,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843118476] [2022-03-15 21:53:52,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:52,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:52,154 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 339 transitions. [2022-03-15 21:53:52,154 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:57,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [10670#(and (or (not (= (select q1 q1_back) (select f i))) (= q2_back q2_front)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (= (select f j) (select q1 q1_front))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))))), 10657#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 10660#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 10667#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10662#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total)))), 10656#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 10659#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 10666#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 10664#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 10661#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 10658#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 10669#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10668#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 10665#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)))), 10663#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)))), 10655#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back)))] [2022-03-15 21:53:57,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:53:57,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:53:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:53:57,203 INFO L87 Difference]: Start difference. First operand 317 states and 1140 transitions. Second operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:59,284 INFO L93 Difference]: Finished difference Result 1482 states and 5084 transitions. [2022-03-15 21:53:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:53:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:53:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:59,293 INFO L225 Difference]: With dead ends: 1482 [2022-03-15 21:53:59,294 INFO L226 Difference]: Without dead ends: 1455 [2022-03-15 21:53:59,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=640, Invalid=2552, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:53:59,295 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 465 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:59,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 52 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:53:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2022-03-15 21:53:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 516. [2022-03-15 21:53:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.7067961165048544) internal successors, (1909), 515 states have internal predecessors, (1909), 0 states have call successors, (0), 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:53:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1909 transitions. [2022-03-15 21:53:59,321 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1909 transitions. Word has length 22 [2022-03-15 21:53:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:59,323 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 1909 transitions. [2022-03-15 21:53:59,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1909 transitions. [2022-03-15 21:53:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:53:59,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:59,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:59,354 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:53:59,547 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:53:59,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1798397536, now seen corresponding path program 2 times [2022-03-15 21:53:59,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:59,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359186872] [2022-03-15 21:53:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:59,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:59,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359186872] [2022-03-15 21:53:59,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359186872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:59,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604101281] [2022-03-15 21:53:59,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:59,665 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:53:59,673 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:53:59,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:59,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:59,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:53:59,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:59,773 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 16 treesize of output 12 [2022-03-15 21:53:59,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 21:53:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:59,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:59,912 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:59,913 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 32 treesize of output 34 [2022-03-15 21:53:59,963 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:59,963 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 31 treesize of output 33 [2022-03-15 21:53:59,976 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:59,977 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 29 treesize of output 31 [2022-03-15 21:54:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:00,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604101281] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:00,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:00,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 21:54:00,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811301021] [2022-03-15 21:54:00,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:00,036 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:00,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 351 transitions. [2022-03-15 21:54:00,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:04,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [13383#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 13389#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)))), 13387#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 13388#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 13382#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 13386#(and (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= (+ total (select q1 q1_front)) 0))), 13391#(and (or (not (= (select q1 q1_back) (select f i))) (= q2_back q2_front)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (= (select f j) (select q1 q1_front))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))))), 13384#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 13385#(and (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (+ total (select q1 q1_front)) 0)) (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1))))), 13390#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))))] [2022-03-15 21:54:04,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:54:04,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:54:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:54:04,274 INFO L87 Difference]: Start difference. First operand 516 states and 1909 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:05,662 INFO L93 Difference]: Finished difference Result 1668 states and 5792 transitions. [2022-03-15 21:54:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:54:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 22 [2022-03-15 21:54:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:05,672 INFO L225 Difference]: With dead ends: 1668 [2022-03-15 21:54:05,672 INFO L226 Difference]: Without dead ends: 1650 [2022-03-15 21:54:05,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:54:05,674 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 426 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:05,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 50 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:54:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-03-15 21:54:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 570. [2022-03-15 21:54:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.701230228471002) internal successors, (2106), 569 states have internal predecessors, (2106), 0 states have call successors, (0), 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:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 2106 transitions. [2022-03-15 21:54:05,697 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 2106 transitions. Word has length 22 [2022-03-15 21:54:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:05,697 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 2106 transitions. [2022-03-15 21:54:05,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 2106 transitions. [2022-03-15 21:54:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:54:05,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:05,699 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:05,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 21:54:05,915 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:54:05,916 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 496835682, now seen corresponding path program 3 times [2022-03-15 21:54:05,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:05,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411450074] [2022-03-15 21:54:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:05,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:05,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411450074] [2022-03-15 21:54:05,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411450074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:05,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854461051] [2022-03-15 21:54:05,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:05,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:05,964 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:54:05,969 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:54:06,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:54:06,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:06,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:54:06,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:06,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:06,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854461051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:06,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:06,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 6 [2022-03-15 21:54:06,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51875890] [2022-03-15 21:54:06,082 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:06,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:06,121 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 441 transitions. [2022-03-15 21:54:06,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:07,565 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 10 treesize of output 8 [2022-03-15 21:54:07,760 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 10 treesize of output 8 [2022-03-15 21:54:07,773 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 10 treesize of output 8 [2022-03-15 21:54:07,910 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 10 treesize of output 8 [2022-03-15 21:54:08,071 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 8 treesize of output 6 [2022-03-15 21:54:08,115 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:08,182 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:08,213 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 8 treesize of output 6 [2022-03-15 21:54:08,322 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 10 treesize of output 8 [2022-03-15 21:54:08,330 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:08,391 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 10 treesize of output 8 [2022-03-15 21:54:08,402 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:08,481 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [16393#(< i N), 16391#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 16396#(or (< i N) (<= q1_back (+ q1_front 1))), 16394#(or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 16399#(or (< (+ i 1) N) (not (< i N)) (<= q1_back q1_front)), 16398#(or (<= N i) (< (+ i 1) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 16395#(or (<= q1_back q1_front) (< i N)), 16397#(or (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 16392#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 16390#(or (< q1_front q1_back) (< i N))] [2022-03-15 21:54:08,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:54:08,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:54:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:54:08,483 INFO L87 Difference]: Start difference. First operand 570 states and 2106 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 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:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:08,775 INFO L93 Difference]: Finished difference Result 1375 states and 4977 transitions. [2022-03-15 21:54:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:54:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 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 24 [2022-03-15 21:54:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:08,784 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 21:54:08,784 INFO L226 Difference]: Without dead ends: 1321 [2022-03-15 21:54:08,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 193 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:54:08,785 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 234 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:08,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 38 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-03-15 21:54:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 978. [2022-03-15 21:54:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.7645854657113613) internal successors, (3678), 977 states have internal predecessors, (3678), 0 states have call successors, (0), 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:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3678 transitions. [2022-03-15 21:54:08,815 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3678 transitions. Word has length 24 [2022-03-15 21:54:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:08,815 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 3678 transitions. [2022-03-15 21:54:08,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 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:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3678 transitions. [2022-03-15 21:54:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:54:08,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:08,818 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:08,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 21:54:09,031 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:54:09,032 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 318519198, now seen corresponding path program 4 times [2022-03-15 21:54:09,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:09,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631231004] [2022-03-15 21:54:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:09,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:09,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631231004] [2022-03-15 21:54:09,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631231004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:54:09,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:54:09,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:54:09,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125000581] [2022-03-15 21:54:09,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:09,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:09,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 141 states and 321 transitions. [2022-03-15 21:54:09,097 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:09,526 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 9 treesize of output 7 [2022-03-15 21:54:09,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:54:09,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:54:09,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:54:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:54:09,829 INFO L87 Difference]: Start difference. First operand 978 states and 3678 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:09,896 INFO L93 Difference]: Finished difference Result 1910 states and 7125 transitions. [2022-03-15 21:54:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:54:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 24 [2022-03-15 21:54:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:09,908 INFO L225 Difference]: With dead ends: 1910 [2022-03-15 21:54:09,908 INFO L226 Difference]: Without dead ends: 1824 [2022-03-15 21:54:09,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:54:09,909 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:09,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:54:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-03-15 21:54:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1663. [2022-03-15 21:54:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 3.8333333333333335) internal successors, (6371), 1662 states have internal predecessors, (6371), 0 states have call successors, (0), 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:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 6371 transitions. [2022-03-15 21:54:09,959 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 6371 transitions. Word has length 24 [2022-03-15 21:54:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:09,960 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 6371 transitions. [2022-03-15 21:54:09,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 6371 transitions. [2022-03-15 21:54:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:54:09,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:09,966 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:09,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 21:54:09,967 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1806428071, now seen corresponding path program 5 times [2022-03-15 21:54:09,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:09,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876199206] [2022-03-15 21:54:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:10,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:10,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876199206] [2022-03-15 21:54:10,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876199206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:10,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933100063] [2022-03-15 21:54:10,008 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:54:10,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:10,010 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:54:10,011 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:54:10,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:54:10,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:10,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:10,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:10,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933100063] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:10,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:10,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:54:10,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091589193] [2022-03-15 21:54:10,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:10,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:10,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 207 states and 483 transitions. [2022-03-15 21:54:10,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:11,202 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 8 treesize of output 6 [2022-03-15 21:54:11,637 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:11,879 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 8 treesize of output 6 [2022-03-15 21:54:11,947 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:11,976 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 10 treesize of output 8 [2022-03-15 21:54:12,011 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,052 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,073 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,109 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,149 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,177 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,214 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,242 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,300 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,325 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,358 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,536 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 8 treesize of output 6 [2022-03-15 21:54:12,541 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,620 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 10 treesize of output 8 [2022-03-15 21:54:12,627 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,675 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 10 treesize of output 8 [2022-03-15 21:54:12,715 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:12,767 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:13,115 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 8 treesize of output 6 [2022-03-15 21:54:13,194 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 8 treesize of output 6 [2022-03-15 21:54:13,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [25150#(or (<= N i) (< (+ i 1) N)), 25157#(or (<= N j) (<= (+ 2 j) N) (< i N)), 25159#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 25148#(or (< (+ i 1) N) (< j N)), 25158#(or (<= N j) (< (+ i 1) N) (<= (+ 2 j) N)), 25156#(or (<= N j) (<= (+ 2 j) N)), 25149#(or (< (+ i 1) N) (< (+ j 1) N)), 25144#(< i N), 25147#(< (+ i 1) N), 25151#(or (<= N i) (< (+ i 1) N) (< j N)), 25155#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ j 1) N)), 25160#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 2 j) N)), 25154#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j N)), 25146#(or (< (+ j 1) N) (< i N)), 25152#(or (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 25145#(or (< j N) (< i N)), 25153#(or (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 21:54:13,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:54:13,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:54:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:54:13,203 INFO L87 Difference]: Start difference. First operand 1663 states and 6371 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:14,033 INFO L93 Difference]: Finished difference Result 5864 states and 21821 transitions. [2022-03-15 21:54:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:54:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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 26 [2022-03-15 21:54:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:14,064 INFO L225 Difference]: With dead ends: 5864 [2022-03-15 21:54:14,064 INFO L226 Difference]: Without dead ends: 5105 [2022-03-15 21:54:14,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=612, Invalid=2144, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:54:14,065 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 446 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:14,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 1 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:54:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2022-03-15 21:54:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3666. [2022-03-15 21:54:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3665 states have (on average 4.072032742155526) internal successors, (14924), 3665 states have internal predecessors, (14924), 0 states have call successors, (0), 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:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 14924 transitions. [2022-03-15 21:54:14,224 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 14924 transitions. Word has length 26 [2022-03-15 21:54:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:14,226 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 14924 transitions. [2022-03-15 21:54:14,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 14924 transitions. [2022-03-15 21:54:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:54:14,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:14,239 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:14,262 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:54:14,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:14,462 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1789966490, now seen corresponding path program 6 times [2022-03-15 21:54:14,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:14,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818218546] [2022-03-15 21:54:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:14,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:14,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818218546] [2022-03-15 21:54:14,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818218546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:14,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130886837] [2022-03-15 21:54:14,504 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:54:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:14,505 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:54:14,506 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:54:14,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:54:14,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:14,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:14,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:14,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:14,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130886837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:14,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:14,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:54:14,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68820348] [2022-03-15 21:54:14,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:14,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:14,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 153 states and 347 transitions. [2022-03-15 21:54:14,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:14,949 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,122 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,246 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 10 treesize of output 8 [2022-03-15 21:54:15,265 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,284 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,303 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,342 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,369 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,396 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:15,800 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 10 treesize of output 8 [2022-03-15 21:54:16,038 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 8 treesize of output 6 [2022-03-15 21:54:16,098 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 8 treesize of output 6 [2022-03-15 21:54:16,106 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:16,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [38570#(< i N), 38569#(< j N), 38574#(or (< (+ i 1) N) (<= N (+ j 1))), 38572#(or (<= N j) (< i N)), 38571#(or (< j N) (< i N)), 38575#(or (<= N i) (< (+ i 1) N) (<= N (+ j 1))), 38573#(or (<= N (+ j 1)) (< i N))] [2022-03-15 21:54:16,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:54:16,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:54:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:54:16,218 INFO L87 Difference]: Start difference. First operand 3666 states and 14924 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 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:54:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:16,633 INFO L93 Difference]: Finished difference Result 7043 states and 28044 transitions. [2022-03-15 21:54:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:54:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 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 26 [2022-03-15 21:54:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:16,666 INFO L225 Difference]: With dead ends: 7043 [2022-03-15 21:54:16,666 INFO L226 Difference]: Without dead ends: 6922 [2022-03-15 21:54:16,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:54:16,667 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 284 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:16,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2022-03-15 21:54:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 5647. [2022-03-15 21:54:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5646 states have (on average 4.17375132837407) internal successors, (23565), 5646 states have internal predecessors, (23565), 0 states have call successors, (0), 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:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 23565 transitions. [2022-03-15 21:54:16,869 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 23565 transitions. Word has length 26 [2022-03-15 21:54:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:16,870 INFO L470 AbstractCegarLoop]: Abstraction has 5647 states and 23565 transitions. [2022-03-15 21:54:16,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 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:54:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 23565 transitions. [2022-03-15 21:54:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:54:16,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:16,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:16,914 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:54:17,111 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,SelfDestructingSolverStorable13 [2022-03-15 21:54:17,111 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1299524028, now seen corresponding path program 7 times [2022-03-15 21:54:17,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:17,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728492581] [2022-03-15 21:54:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:17,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:17,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728492581] [2022-03-15 21:54:17,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728492581] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:17,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694050065] [2022-03-15 21:54:17,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:17,152 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:54:17,184 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:54:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:17,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:17,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:17,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:17,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694050065] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:17,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:17,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2022-03-15 21:54:17,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893145404] [2022-03-15 21:54:17,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:17,326 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:17,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 350 transitions. [2022-03-15 21:54:17,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:17,573 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 10 treesize of output 8 [2022-03-15 21:54:17,746 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 10 treesize of output 8 [2022-03-15 21:54:17,901 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 10 treesize of output 8 [2022-03-15 21:54:18,268 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 8 treesize of output 6 [2022-03-15 21:54:18,318 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:18,376 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:18,403 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 10 treesize of output 8 [2022-03-15 21:54:18,407 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:18,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [57104#(< (+ i 1) N), 57101#(or (<= N (+ j 1)) (< i N)), 57098#(or (< j N) (< i N)), 57100#(or (<= N j) (< i N)), 57103#(or (<= N j) (<= i (+ j 1))), 57106#(or (<= N i) (<= i j)), 57105#(or (< (+ i 1) N) (< j N)), 57107#(or (<= N j) (<= i j)), 57096#(< j N), 57102#(<= i (+ j 1)), 57097#(< i N), 57099#(<= N (+ j 1))] [2022-03-15 21:54:18,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:54:18,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:18,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:54:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:54:18,548 INFO L87 Difference]: Start difference. First operand 5647 states and 23565 transitions. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 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:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:19,040 INFO L93 Difference]: Finished difference Result 8726 states and 35021 transitions. [2022-03-15 21:54:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:54:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 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 26 [2022-03-15 21:54:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:19,078 INFO L225 Difference]: With dead ends: 8726 [2022-03-15 21:54:19,078 INFO L226 Difference]: Without dead ends: 8648 [2022-03-15 21:54:19,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:54:19,082 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 306 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:19,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 1 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2022-03-15 21:54:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 5987. [2022-03-15 21:54:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5987 states, 5986 states have (on average 4.211159371867692) internal successors, (25208), 5986 states have internal predecessors, (25208), 0 states have call successors, (0), 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:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 25208 transitions. [2022-03-15 21:54:19,308 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 25208 transitions. Word has length 26 [2022-03-15 21:54:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:19,309 INFO L470 AbstractCegarLoop]: Abstraction has 5987 states and 25208 transitions. [2022-03-15 21:54:19,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 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:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 25208 transitions. [2022-03-15 21:54:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:19,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:19,326 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:19,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 21:54:19,539 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,SelfDestructingSolverStorable14 [2022-03-15 21:54:19,539 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1446283875, now seen corresponding path program 8 times [2022-03-15 21:54:19,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:19,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332298049] [2022-03-15 21:54:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:54:19,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:19,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332298049] [2022-03-15 21:54:19,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332298049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:19,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082030834] [2022-03-15 21:54:19,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:19,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:19,577 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:19,581 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:19,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:19,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:19,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:19,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:54:19,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:54:19,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082030834] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:54:19,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:54:19,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-03-15 21:54:19,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772110105] [2022-03-15 21:54:19,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:19,657 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:19,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 251 states and 589 transitions. [2022-03-15 21:54:19,702 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:21,489 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 9 treesize of output 7 [2022-03-15 21:54:21,964 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 9 treesize of output 7 [2022-03-15 21:54:22,074 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 9 treesize of output 7 [2022-03-15 21:54:22,182 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 9 treesize of output 7 [2022-03-15 21:54:22,241 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 9 treesize of output 7 [2022-03-15 21:54:22,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [77927#(or (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))] [2022-03-15 21:54:22,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:54:22,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:54:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:54:22,261 INFO L87 Difference]: Start difference. First operand 5987 states and 25208 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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:54:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:22,408 INFO L93 Difference]: Finished difference Result 8187 states and 34478 transitions. [2022-03-15 21:54:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:54:22,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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 28 [2022-03-15 21:54:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:22,440 INFO L225 Difference]: With dead ends: 8187 [2022-03-15 21:54:22,440 INFO L226 Difference]: Without dead ends: 8187 [2022-03-15 21:54:22,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:54:22,441 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:22,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:54:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2022-03-15 21:54:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 6338. [2022-03-15 21:54:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6337 states have (on average 4.2171374467413605) internal successors, (26724), 6337 states have internal predecessors, (26724), 0 states have call successors, (0), 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:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 26724 transitions. [2022-03-15 21:54:22,618 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 26724 transitions. Word has length 28 [2022-03-15 21:54:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:22,619 INFO L470 AbstractCegarLoop]: Abstraction has 6338 states and 26724 transitions. [2022-03-15 21:54:22,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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:54:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 26724 transitions. [2022-03-15 21:54:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:22,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:22,637 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:22,661 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:22,859 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,SelfDestructingSolverStorable15 [2022-03-15 21:54:22,859 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1882834591, now seen corresponding path program 9 times [2022-03-15 21:54:22,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:22,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918534734] [2022-03-15 21:54:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:22,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:22,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918534734] [2022-03-15 21:54:22,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918534734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:22,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679370159] [2022-03-15 21:54:22,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:22,886 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:22,914 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:22,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:54:22,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:22,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:22,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:22,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:23,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679370159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:23,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:23,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 21:54:23,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343802615] [2022-03-15 21:54:23,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:23,013 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:23,041 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 381 transitions. [2022-03-15 21:54:23,041 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:24,013 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 8 treesize of output 6 [2022-03-15 21:54:24,042 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:24,075 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 8 treesize of output 6 [2022-03-15 21:54:24,106 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 8 treesize of output 6 [2022-03-15 21:54:24,180 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 8 treesize of output 6 [2022-03-15 21:54:24,310 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 8 treesize of output 6 [2022-03-15 21:54:24,362 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:24,380 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 8 treesize of output 6 [2022-03-15 21:54:24,426 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:54:24,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [98961#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back)), 98962#(or (<= (+ q1_back 1) q1_front) (<= (+ q1_front 1) q1_back)), 98963#(or (<= q1_front q1_back) (<= (+ q1_back 2) q1_front)), 98801#(<= q1_front q1_back)] [2022-03-15 21:54:24,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:54:24,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:54:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:54:24,472 INFO L87 Difference]: Start difference. First operand 6338 states and 26724 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:24,580 INFO L93 Difference]: Finished difference Result 9829 states and 41765 transitions. [2022-03-15 21:54:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:54:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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 28 [2022-03-15 21:54:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:24,614 INFO L225 Difference]: With dead ends: 9829 [2022-03-15 21:54:24,615 INFO L226 Difference]: Without dead ends: 9829 [2022-03-15 21:54:24,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 9 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:54:24,615 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 127 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:24,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 21 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:54:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2022-03-15 21:54:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 8685. [2022-03-15 21:54:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8685 states, 8684 states have (on average 4.269115614923998) internal successors, (37073), 8684 states have internal predecessors, (37073), 0 states have call successors, (0), 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,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8685 states to 8685 states and 37073 transitions. [2022-03-15 21:54:24,939 INFO L78 Accepts]: Start accepts. Automaton has 8685 states and 37073 transitions. Word has length 28 [2022-03-15 21:54:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:24,939 INFO L470 AbstractCegarLoop]: Abstraction has 8685 states and 37073 transitions. [2022-03-15 21:54:24,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8685 states and 37073 transitions. [2022-03-15 21:54:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:24,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:24,963 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:24,986 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:25,183 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,SelfDestructingSolverStorable16 [2022-03-15 21:54:25,183 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash -175319710, now seen corresponding path program 10 times [2022-03-15 21:54:25,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:25,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017546369] [2022-03-15 21:54:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:25,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:54:25,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:25,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017546369] [2022-03-15 21:54:25,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017546369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:25,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522628985] [2022-03-15 21:54:25,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:54:25,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:25,231 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:25,232 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:25,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:54:25,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:25,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:25,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:25,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:25,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522628985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:25,454 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:25,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:54:25,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778927532] [2022-03-15 21:54:25,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:25,458 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:25,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 353 transitions. [2022-03-15 21:54:25,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:26,468 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 8 treesize of output 6 [2022-03-15 21:54:26,494 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 8 treesize of output 6 [2022-03-15 21:54:26,594 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 8 treesize of output 6 [2022-03-15 21:54:26,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [126340#(<= q1_front q1_back), 126339#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back))] [2022-03-15 21:54:26,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:54:26,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:54:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:54:26,729 INFO L87 Difference]: Start difference. First operand 8685 states and 37073 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:26,907 INFO L93 Difference]: Finished difference Result 13904 states and 59553 transitions. [2022-03-15 21:54:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:54:26,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2022-03-15 21:54:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:26,954 INFO L225 Difference]: With dead ends: 13904 [2022-03-15 21:54:26,954 INFO L226 Difference]: Without dead ends: 13904 [2022-03-15 21:54:26,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:54:26,955 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:26,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 35 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:54:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13904 states. [2022-03-15 21:54:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13904 to 10433. [2022-03-15 21:54:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10433 states, 10432 states have (on average 4.274252300613497) internal successors, (44589), 10432 states have internal predecessors, (44589), 0 states have call successors, (0), 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,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10433 states to 10433 states and 44589 transitions. [2022-03-15 21:54:27,435 INFO L78 Accepts]: Start accepts. Automaton has 10433 states and 44589 transitions. Word has length 28 [2022-03-15 21:54:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:27,435 INFO L470 AbstractCegarLoop]: Abstraction has 10433 states and 44589 transitions. [2022-03-15 21:54:27,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10433 states and 44589 transitions. [2022-03-15 21:54:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:54:27,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:27,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:27,497 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:27,695 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,SelfDestructingSolverStorable17 [2022-03-15 21:54:27,695 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:54:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1771117471, now seen corresponding path program 11 times [2022-03-15 21:54:27,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:27,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085281725] [2022-03-15 21:54:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:28,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:28,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085281725] [2022-03-15 21:54:28,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085281725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:28,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612285623] [2022-03-15 21:54:28,226 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:54:28,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:28,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:28,227 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:28,228 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:28,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:54:28,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:28,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 21:54:28,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:28,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:28,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:28,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:28,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:28,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2022-03-15 21:54:28,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-03-15 21:54:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:28,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:29,266 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:54:29,266 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 47 treesize of output 71 [2022-03-15 21:54:29,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:29,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:29,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:29,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:29,634 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 45 treesize of output 33 [2022-03-15 21:54:29,668 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:54:29,668 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 20 treesize of output 45 [2022-03-15 21:54:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:29,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612285623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:29,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:29,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-03-15 21:54:29,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656595377] [2022-03-15 21:54:29,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:29,808 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:29,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 195 states and 447 transitions. [2022-03-15 21:54:29,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:57,035 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [161352#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 161334#(and (or (< (+ 2 j) N) (<= total (select f (+ (- 1) N))) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< i N) (= q2_back q2_front)) (or (<= (select f (+ (- 1) N)) total) (< (+ 2 j) N) (< i N))), 161348#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161353#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 161372#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161347#(and (or (< (+ 2 j) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ (- 1) N))) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back)))), 161344#(and (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161363#(and (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 161374#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 161360#(and (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ i 1) N) (= q2_back q2_front)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 161327#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 161355#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161356#(and (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161323#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 161328#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 161335#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161329#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 161340#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total)) (< i N)) (or (< (+ 2 j) N) (<= (+ (select q2 q2_front) total) (select f (+ (- 1) N))) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (= (+ q2_front 1) q2_back) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 161322#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 161365#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 161359#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (< i N) (= q2_back q2_front))), 161333#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 161332#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161354#(and (or (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 161342#(and (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (= (+ q2_front 1) q2_back) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ (- 1) N))) (< i N) (not (< q1_front q1_back)))), 161339#(and (or (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (select f (+ (- 1) N))) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (select f (+ (- 1) N)) total) (< (+ 2 j) N) (< q1_front q1_back) (< i N))), 161326#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 161324#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 161369#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 161345#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161357#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)))), 161362#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 161337#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 161325#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 161351#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 161364#(and (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161373#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= q2_back q2_front))), 161338#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 161343#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (<= total (select f j)) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 161358#(and (or (<= 0 total) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161341#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 161371#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 161349#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161375#(and (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 161366#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ q2_front 1) q2_back) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 161367#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 161350#(and (or (< (+ q1_front 2) q1_back) (= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 161336#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161370#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161368#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 161330#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161361#(and (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (= (+ q2_front 1) q2_back) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 161331#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161346#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)))] [2022-03-15 21:54:57,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 21:54:57,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:57,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 21:54:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=7373, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:54:57,041 INFO L87 Difference]: Start difference. First operand 10433 states and 44589 transitions. Second operand has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 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:56:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:50,977 INFO L93 Difference]: Finished difference Result 33799 states and 132521 transitions. [2022-03-15 21:56:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2022-03-15 21:56:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 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 30 [2022-03-15 21:56:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:51,193 INFO L225 Difference]: With dead ends: 33799 [2022-03-15 21:56:51,194 INFO L226 Difference]: Without dead ends: 33712 [2022-03-15 21:56:51,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 129 SyntacticMatches, 18 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124551 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=33228, Invalid=263252, Unknown=0, NotChecked=0, Total=296480 [2022-03-15 21:56:51,214 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3377 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 15298 mSolverCounterSat, 1942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3377 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1942 IncrementalHoareTripleChecker+Valid, 15298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:51,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3377 Valid, 1 Invalid, 17240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1942 Valid, 15298 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-03-15 21:56:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33712 states. [2022-03-15 21:56:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33712 to 10703. [2022-03-15 21:56:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10703 states, 10702 states have (on average 4.268267613530181) internal successors, (45679), 10702 states have internal predecessors, (45679), 0 states have call successors, (0), 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:56:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 45679 transitions. [2022-03-15 21:56:51,612 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 45679 transitions. Word has length 30 [2022-03-15 21:56:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:51,613 INFO L470 AbstractCegarLoop]: Abstraction has 10703 states and 45679 transitions. [2022-03-15 21:56:51,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 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:56:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 45679 transitions. [2022-03-15 21:56:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:56:51,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:51,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:51,653 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:56:51,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:51,838 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1338767845, now seen corresponding path program 12 times [2022-03-15 21:56:51,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:51,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897544437] [2022-03-15 21:56:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:52,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:52,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897544437] [2022-03-15 21:56:52,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897544437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:52,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782374138] [2022-03-15 21:56:52,277 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:56:52,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:52,278 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:56:52,279 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:56:52,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:56:52,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:52,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 21:56:52,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:52,722 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:56:52,722 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 32 treesize of output 16 [2022-03-15 21:56:52,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:52,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:52,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-03-15 21:56:52,980 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:52,980 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:56:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:53,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:53,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:53,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2022-03-15 21:56:53,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,905 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:53,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 62 [2022-03-15 21:56:53,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,925 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:53,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 80 [2022-03-15 21:56:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:54,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782374138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:54,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:54,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2022-03-15 21:56:54,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241951484] [2022-03-15 21:56:54,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:54,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:54,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 217 states and 506 transitions. [2022-03-15 21:56:54,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:27,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 63 new interpolants: [217745#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 217713#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217755#(and (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217730#(and (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 217761#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217750#(and (or (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 217704#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 217734#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back)))), 217737#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back)))), 217731#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 217719#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 217720#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217764#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= q2_back q2_front))), 217739#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217721#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217754#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217753#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217723#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 217724#(and (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N))), 217743#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 217748#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (<= total (select f j)) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 217760#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 217728#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total) (select f (+ j 1))) (< i N)) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 217705#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 217746#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 217717#(and (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (<= (+ 3 j) N)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (<= (+ 3 j) N)) (or (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front))), 217736#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217718#(and (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (<= (+ 3 j) N) (< i N)) (or (< i N) (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (<= (+ 3 j) N) (< i N))), 217738#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 217762#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (< i N) (= q2_back q2_front))), 217722#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 217706#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 217727#(and (or (< q1_front q1_back) (< i N) (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (< q1_front q1_back) (<= (+ 3 j) N) (< i N)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (< q1_front q1_back) (<= (+ 3 j) N) (< i N))), 217759#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217740#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back)))), 217757#(and (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217733#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back)))), 217712#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217752#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217758#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 217709#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 217715#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 217732#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)))), 217765#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 217726#(and (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back)))), 217716#(and (or (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N))), 217707#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 217766#(and (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 217751#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 217747#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 217711#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 217725#(and (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (select f j) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f j)) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back)))), 217714#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217763#(and (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ i 1) N) (= q2_back q2_front)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 217708#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 217742#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 217729#(and (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back)))), 217710#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 217735#(and (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217756#(and (or (<= 0 total) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217741#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 217749#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 217744#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))))] [2022-03-15 21:57:27,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 21:57:27,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 21:57:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=9617, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 21:57:27,472 INFO L87 Difference]: Start difference. First operand 10703 states and 45679 transitions. Second operand has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:57,375 INFO L93 Difference]: Finished difference Result 49057 states and 196880 transitions. [2022-03-15 22:01:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 869 states. [2022-03-15 22:01:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 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 30 [2022-03-15 22:01:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:57,548 INFO L225 Difference]: With dead ends: 49057 [2022-03-15 22:01:57,548 INFO L226 Difference]: Without dead ends: 48925 [2022-03-15 22:01:57,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 133 SyntacticMatches, 23 SemanticMatches, 942 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410339 ImplicationChecksByTransitivity, 257.7s TimeCoverageRelationStatistics Valid=86578, Invalid=803614, Unknown=0, NotChecked=0, Total=890192 [2022-03-15 22:01:57,596 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 5945 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 17912 mSolverCounterSat, 4051 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5945 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 21963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4051 IncrementalHoareTripleChecker+Valid, 17912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:57,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5945 Valid, 1 Invalid, 21963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4051 Valid, 17912 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2022-03-15 22:01:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48925 states. [2022-03-15 22:01:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48925 to 10873. [2022-03-15 22:01:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10873 states, 10872 states have (on average 4.271891096394407) internal successors, (46444), 10872 states have internal predecessors, (46444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 46444 transitions. [2022-03-15 22:01:58,316 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 46444 transitions. Word has length 30 [2022-03-15 22:01:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:58,316 INFO L470 AbstractCegarLoop]: Abstraction has 10873 states and 46444 transitions. [2022-03-15 22:01:58,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 46444 transitions. [2022-03-15 22:01:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:01:58,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:58,340 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:58,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:58,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:58,540 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 22:01:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 486247649, now seen corresponding path program 13 times [2022-03-15 22:01:58,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:58,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328287468] [2022-03-15 22:01:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:58,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:58,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328287468] [2022-03-15 22:01:58,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328287468] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:58,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649452680] [2022-03-15 22:01:58,904 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:01:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:58,908 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:58,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 22:01:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:58,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 22:01:58,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:59,202 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:01:59,202 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 28 treesize of output 16 [2022-03-15 22:01:59,290 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 30 treesize of output 22 [2022-03-15 22:01:59,328 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 22:01:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:59,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:59,584 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:59,584 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 44 treesize of output 68 [2022-03-15 22:01:59,776 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:59,776 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 45 treesize of output 69 [2022-03-15 22:01:59,804 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:59,804 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 67 treesize of output 85 [2022-03-15 22:02:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:00,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649452680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:00,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:00,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2022-03-15 22:02:00,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350560345] [2022-03-15 22:02:00,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:00,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:00,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 527 transitions. [2022-03-15 22:02:00,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:36,947 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 66 new interpolants: [290470#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 290521#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290468#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 290487#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290516#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 290488#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< (+ q1_front 1) q1_back)))), 290504#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 290514#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290501#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 290511#(and (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (< (+ i 1) N)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 290457#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 290477#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290482#(and (or (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N))), 290500#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back)))), 290462#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 290474#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (<= (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 290466#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back)))), 290497#(and (or (< (+ 2 j) N) (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290472#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290476#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total) (select f (+ j 1))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 290494#(and (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290495#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290507#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back)))), 290479#(and (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (select f j) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f j)) (< i N) (not (< q1_front q1_back)))), 290491#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back q2_front) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)))), 290510#(and (or (<= 0 total) (< (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (< (+ 2 j) N) (= (select f j) (select q1 q1_front)) (< i N)) (or (< (+ 2 j) N) (<= total 0) (< i N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (< i N))), 290506#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290502#(and (or (< (+ 2 j) N) (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (< (+ 2 j) N) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 290489#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 290469#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 290519#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 290461#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290493#(and (or (<= 0 total) (< (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (< i N)) (or (< (+ 2 j) N) (<= total 0) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 290522#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (= (+ q2_back (* (- 1) q2_front)) 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 290460#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 290520#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1))))), 290508#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290465#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 290478#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290480#(and (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (< i N) (not (< q1_front q1_back)))), 290481#(and (or (< (+ 2 j) N) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back)))), 290505#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290515#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ q2_back (* (- 1) q2_front)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 290473#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290499#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290509#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N)) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back))), 290513#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 290471#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290496#(and (or (< (+ 2 j) N) (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290458#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 290498#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290467#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (< i N) (not (< (+ q1_front 1) q1_back)))), 290459#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 290485#(and (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 290483#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 290463#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290475#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N))), 290490#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)))), 290486#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 290503#(and (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290464#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 290492#(and (or (< (+ 2 j) N) (<= total (select f j)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 290512#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)))), 290484#(and (or (< (+ q1_front 2) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back)))), 290517#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 290518#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 22:02:36,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-15 22:02:36,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-15 22:02:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=998, Invalid=8704, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:02:36,949 INFO L87 Difference]: Start difference. First operand 10873 states and 46444 transitions. Second operand has 82 states, 81 states have (on average 3.5185185185185186) internal successors, (285), 81 states have internal predecessors, (285), 0 states have call successors, (0), 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:05:40,362 WARN L244 SmtUtils]: Removed 24 from assertion stack [2022-03-15 22:05:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 469 states. [2022-03-15 22:05:40,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 142 SyntacticMatches, 29 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132151 ImplicationChecksByTransitivity, 181.5s TimeCoverageRelationStatistics Valid=38942, Invalid=271864, Unknown=0, NotChecked=0, Total=310806 [2022-03-15 22:05:40,374 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 4008 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 8140 mSolverCounterSat, 2783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 10923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2783 IncrementalHoareTripleChecker+Valid, 8140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:40,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 1 Invalid, 10923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2783 Valid, 8140 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-03-15 22:05:40,375 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2022-03-15 22:05:40,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:05:40,377 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:05:40,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 22:05:40,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:40,576 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. [2022-03-15 22:05:40,578 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 22:05:40,578 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 22:05:40,578 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 22:05:40,578 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 22:05:40,579 INFO L732 BasicCegarLoop]: Path program histogram: [13, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:40,581 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:05:40,581 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:05:40,582 INFO L202 PluginConnector]: Adding new model buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:05:40 BasicIcfg [2022-03-15 22:05:40,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:05:40,585 INFO L158 Benchmark]: Toolchain (without parser) took 720087.80ms. Allocated memory was 181.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 141.0MB in the beginning and 540.7MB in the end (delta: -399.6MB). Peak memory consumption was 618.0MB. Max. memory is 8.0GB. [2022-03-15 22:05:40,585 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:05:40,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.01ms. Allocated memory is still 181.4MB. Free memory was 141.0MB in the beginning and 139.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:05:40,586 INFO L158 Benchmark]: Boogie Preprocessor took 14.90ms. Allocated memory is still 181.4MB. Free memory was 139.4MB in the beginning and 138.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:05:40,586 INFO L158 Benchmark]: RCFGBuilder took 287.83ms. Allocated memory is still 181.4MB. Free memory was 138.3MB in the beginning and 128.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:05:40,586 INFO L158 Benchmark]: TraceAbstraction took 719753.53ms. Allocated memory was 181.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.0MB in the beginning and 540.7MB in the end (delta: -412.7MB). Peak memory consumption was 604.4MB. Max. memory is 8.0GB. [2022-03-15 22:05:40,587 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.13ms. Allocated memory is still 181.4MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.01ms. Allocated memory is still 181.4MB. Free memory was 141.0MB in the beginning and 139.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.90ms. Allocated memory is still 181.4MB. Free memory was 139.4MB in the beginning and 138.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.83ms. Allocated memory is still 181.4MB. Free memory was 138.3MB in the beginning and 128.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 719753.53ms. Allocated memory was 181.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.0MB in the beginning and 540.7MB in the end (delta: -412.7MB). Peak memory consumption was 604.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 36 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 347, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 159, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 347, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 159, unknown conditional: 0, unknown unconditional: 159] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - 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: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. - TimeoutResultAtElement [Line: 73]: 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 (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. - TimeoutResultAtElement [Line: 73]: 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 (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. - TimeoutResultAtElement [Line: 74]: 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 (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. - TimeoutResultAtElement [Line: 75]: 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 (10873states) and FLOYD_HOARE automaton (currently 469 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 121 for 103ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 719.6s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.2s, AutomataDifference: 575.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16189 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16189 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11006 mSDsCounter, 9529 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47716 IncrementalHoareTripleChecker+Invalid, 57245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9529 mSolverCounterUnsat, 101 mSDtfsCounter, 47716 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5299 GetRequests, 2776 SyntacticMatches, 154 SemanticMatches, 2368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670390 ImplicationChecksByTransitivity, 550.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10873occurred in iteration=20, InterpolantAutomatonStates: 1606, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 76194 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1126 ConstructedInterpolants, 44 QuantifiedInterpolants, 12102 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1448 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 48 InterpolantComputations, 9 PerfectInterpolantSequences, 207/423 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