/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/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:16:18,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:16:18,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:16:18,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:16:18,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:16:18,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:16:18,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:16:18,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:16:18,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:16:18,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:16:18,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:16:18,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:16:18,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:16:18,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:16:18,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:16:18,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:16:18,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:16:18,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:16:18,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:16:18,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:16:18,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:16:18,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:16:18,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:16:18,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:16:18,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:16:18,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:16:18,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:16:18,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:16:18,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:16:18,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:16:18,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:16:18,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:16:18,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:16:18,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:16:18,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:16:18,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:16:18,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:16:18,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:16:18,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:16:18,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:16:18,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:16:18,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 22:16:18,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:16:18,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:16:18,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:16:18,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:16:18,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:16:18,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:16:18,454 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:16:18,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:16:18,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:16:18,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:16:18,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:16:18,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:16:18,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:16:18,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:16:18,457 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:16:18,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:16:18,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:16:18,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:16:18,653 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:16:18,654 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:16:18,655 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/queue-add-3-nl.wvr.bpl [2022-03-15 22:16:18,655 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2022-03-15 22:16:18,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:16:18,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:16:18,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:16:18,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:16:18,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:16:18,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,730 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:16:18,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:16:18,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:16:18,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:16:18,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:16:18,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:16:18,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:16:18,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:16:18,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:16:18,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/1) ... [2022-03-15 22:16:18,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:16:18,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:18,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:16:18,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:16:18,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:16:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:16:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:16:18,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:16:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:16:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:16:18,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:16:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:16:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:16:18,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:16:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:16:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:16:18,869 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:16:18,916 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:16:18,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:16:19,036 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:16:19,049 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:16:19,050 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:16:19,051 INFO L202 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:16:19 BoogieIcfgContainer [2022-03-15 22:16:19,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:16:19,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:16:19,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:16:19,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:16:19,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:18" (1/2) ... [2022-03-15 22:16:19,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db91db5 and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:16:19, skipping insertion in model container [2022-03-15 22:16:19,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:16:19" (2/2) ... [2022-03-15 22:16:19,058 INFO L111 eAbstractionObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2022-03-15 22:16:19,061 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:16:19,061 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:16:19,061 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:16:19,062 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:16:19,104 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:16:19,142 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:16:19,156 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 22:16:19,156 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:16:19,176 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:16:19,190 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 108 flow [2022-03-15 22:16:19,192 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 42 transitions, 108 flow [2022-03-15 22:16:19,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 42 transitions, 108 flow [2022-03-15 22:16:19,219 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2022-03-15 22:16:19,220 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:16:19,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2022-03-15 22:16:19,226 INFO L116 LiptonReduction]: Number of co-enabled transitions 634 [2022-03-15 22:16:19,688 INFO L131 LiptonReduction]: Checked pairs total: 665 [2022-03-15 22:16:19,688 INFO L133 LiptonReduction]: Total number of compositions: 21 [2022-03-15 22:16:19,694 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 68 flow [2022-03-15 22:16:19,713 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:16:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:16:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:19,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:19,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:19,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1059773042, now seen corresponding path program 1 times [2022-03-15 22:16:19,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:19,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838998043] [2022-03-15 22:16:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:19,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:19,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838998043] [2022-03-15 22:16:19,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838998043] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:19,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:19,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:16:19,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [111196647] [2022-03-15 22:16:19,825 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:19,835 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:19,852 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:16:19,852 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:20,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:16:20,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:16:20,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:16:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:16:20,092 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 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, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:16:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:20,121 INFO L93 Difference]: Finished difference Result 87 states and 246 transitions. [2022-03-15 22:16:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:16:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:20,129 INFO L225 Difference]: With dead ends: 87 [2022-03-15 22:16:20,129 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 22:16:20,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:16:20,132 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:20,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 22:16:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-03-15 22:16:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.86046511627907) internal successors, (246), 86 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have 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:16:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 246 transitions. [2022-03-15 22:16:20,159 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 246 transitions. Word has length 14 [2022-03-15 22:16:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:20,159 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 246 transitions. [2022-03-15 22:16:20,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:16:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 246 transitions. [2022-03-15 22:16:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:16:20,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:20,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:20,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:16:20,161 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash -19199319, now seen corresponding path program 1 times [2022-03-15 22:16:20,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:20,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419694874] [2022-03-15 22:16:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:20,189 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 22:16:20,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:20,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419694874] [2022-03-15 22:16:20,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419694874] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:20,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:20,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:16:20,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044480017] [2022-03-15 22:16:20,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:20,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:20,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:16:20,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:20,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [459#(<= q2_back q2_front)] [2022-03-15 22:16:20,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:16:20,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:16:20,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:16:20,494 INFO L87 Difference]: Start difference. First operand 87 states and 246 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:20,521 INFO L93 Difference]: Finished difference Result 114 states and 308 transitions. [2022-03-15 22:16:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:16:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:16:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:20,522 INFO L225 Difference]: With dead ends: 114 [2022-03-15 22:16:20,522 INFO L226 Difference]: Without dead ends: 101 [2022-03-15 22:16:20,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:16:20,523 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:20,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-15 22:16:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-03-15 22:16:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.76) internal successors, (276), 100 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:16:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 276 transitions. [2022-03-15 22:16:20,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 276 transitions. Word has length 15 [2022-03-15 22:16:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:20,531 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 276 transitions. [2022-03-15 22:16:20,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 276 transitions. [2022-03-15 22:16:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:20,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:20,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:20,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:16:20,532 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 193432252, now seen corresponding path program 1 times [2022-03-15 22:16:20,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:20,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161581944] [2022-03-15 22:16:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:20,550 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 22:16:20,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:20,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161581944] [2022-03-15 22:16:20,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161581944] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:20,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:20,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:16:20,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441922482] [2022-03-15 22:16:20,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:20,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:20,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:16:20,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:20,650 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 6 treesize of output 4 [2022-03-15 22:16:20,839 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [779#(<= q1_back q1_front)] [2022-03-15 22:16:20,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:16:20,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:16:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:16:20,840 INFO L87 Difference]: Start difference. First operand 101 states and 276 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:16:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:20,867 INFO L93 Difference]: Finished difference Result 90 states and 242 transitions. [2022-03-15 22:16:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:16:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:16:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:20,868 INFO L225 Difference]: With dead ends: 90 [2022-03-15 22:16:20,869 INFO L226 Difference]: Without dead ends: 90 [2022-03-15 22:16:20,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:16:20,870 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:20,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-03-15 22:16:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-03-15 22:16:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.7191011235955056) internal successors, (242), 89 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:16:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 242 transitions. [2022-03-15 22:16:20,876 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 242 transitions. Word has length 17 [2022-03-15 22:16:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:20,877 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 242 transitions. [2022-03-15 22:16:20,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:16:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 242 transitions. [2022-03-15 22:16:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:20,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:20,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:20,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:16:20,878 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -597728564, now seen corresponding path program 2 times [2022-03-15 22:16:20,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:20,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463139477] [2022-03-15 22:16:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:21,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:21,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463139477] [2022-03-15 22:16:21,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463139477] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:21,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104347935] [2022-03-15 22:16:21,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:21,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 22:16:21,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:21,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:21,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:16:21,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:21,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:21,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104347935] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:21,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:21,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-03-15 22:16:21,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882966689] [2022-03-15 22:16:21,768 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:21,770 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:21,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 103 transitions. [2022-03-15 22:16:21,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:21,839 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 22:16:21,862 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 22:16:22,056 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 22:16:22,088 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 22:16:22,458 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 22:16:22,480 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 22:16:22,688 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 22:16:22,702 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 22:16:23,319 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1166#(and (or (not g) (< (+ C z) (+ x 1))) (or (<= x (+ C z)) (not g)) (or (< t (+ N 1)) (not g)) (or (not g) (< y (+ x 1))) (or (not g) (<= x y)) (or (<= N t) (not g))), 1170#(and (= (+ (* (- 1) z) x) 0) (= (+ x (* (- 1) y)) 0) (<= 0 N) (= (+ (* (- 1) t) z) 0) (= x 0)), 1169#(and (<= x (+ C z)) (<= (+ C y) x) (<= (+ C z) x) (<= z N) (<= N z) (= z 0) (<= x (+ C y))), 1167#(and (<= x (+ C z)) (< (+ C z) (+ x 1)) (<= N 0) (<= x y) (< y (+ x 1)) (< 0 (+ N 1))), 1168#(and (<= x (+ C z)) (<= (+ C z) x) (<= z N) (<= x y) (<= N z) (< y (+ x 1)) (= z 0))] [2022-03-15 22:16:23,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:16:23,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:16:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:16:23,322 INFO L87 Difference]: Start difference. First operand 90 states and 242 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:23,784 INFO L93 Difference]: Finished difference Result 182 states and 442 transitions. [2022-03-15 22:16:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:16:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:16:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:23,786 INFO L225 Difference]: With dead ends: 182 [2022-03-15 22:16:23,786 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 22:16:23,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:16:23,787 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:23,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:16:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 22:16:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 122. [2022-03-15 22:16:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.5867768595041323) internal successors, (313), 121 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:16:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2022-03-15 22:16:23,792 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 17 [2022-03-15 22:16:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:23,793 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2022-03-15 22:16:23,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2022-03-15 22:16:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:16:23,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:23,794 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 22:16:23,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:16:23,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:23,995 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 444321596, now seen corresponding path program 1 times [2022-03-15 22:16:23,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:23,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315407279] [2022-03-15 22:16:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:24,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:24,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315407279] [2022-03-15 22:16:24,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315407279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:24,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926830430] [2022-03-15 22:16:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:24,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:24,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:24,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:16:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:24,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:16:24,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:24,193 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 11 treesize of output 7 [2022-03-15 22:16:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:24,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:24,253 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:16:24,253 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 13 treesize of output 12 [2022-03-15 22:16:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:24,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926830430] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:24,261 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:24,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:16:24,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973259993] [2022-03-15 22:16:24,261 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:24,263 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:24,272 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 124 transitions. [2022-03-15 22:16:24,272 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:24,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1725#(and (or (<= q1_back q1_front) (= z 0)) (or (<= q1_back q1_front) (not (= (+ (* (- 1) z) (select q1 q1_front)) 0)))), 1722#(not (= (select q1 q1_back) 0)), 1724#(and (or (not f) (<= q1_back q1_front) (= z 0)) (or (not f) (<= q1_back q1_front) (not (= (+ (* (- 1) z) (select q1 q1_front)) 0)))), 1723#(or f (not (= (select q1 q1_back) 0))), 1727#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not (= (+ (* (- 1) z) (select q1 q1_front)) 0)))), 1726#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (not (= (+ (* (- 1) z) (select q1 q1_front)) 0))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (= z 0)))] [2022-03-15 22:16:24,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:16:24,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:16:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:16:24,968 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:16:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:25,156 INFO L93 Difference]: Finished difference Result 161 states and 408 transitions. [2022-03-15 22:16:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:16:25,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:16:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:25,157 INFO L225 Difference]: With dead ends: 161 [2022-03-15 22:16:25,157 INFO L226 Difference]: Without dead ends: 161 [2022-03-15 22:16:25,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:16:25,158 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:25,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 12 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-15 22:16:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2022-03-15 22:16:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.6466165413533833) internal successors, (352), 133 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have 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:16:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 352 transitions. [2022-03-15 22:16:25,164 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 352 transitions. Word has length 18 [2022-03-15 22:16:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:25,164 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 352 transitions. [2022-03-15 22:16:25,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:16:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 352 transitions. [2022-03-15 22:16:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:16:25,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:25,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:25,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:25,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:25,382 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1138141739, now seen corresponding path program 3 times [2022-03-15 22:16:25,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:25,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688824708] [2022-03-15 22:16:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:25,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:25,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688824708] [2022-03-15 22:16:25,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688824708] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:25,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:25,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 22:16:25,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779139757] [2022-03-15 22:16:25,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:25,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:25,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 113 transitions. [2022-03-15 22:16:25,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:25,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:16:25,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 22:16:25,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 22:16:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 22:16:25,604 INFO L87 Difference]: Start difference. First operand 134 states and 352 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:16:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:25,647 INFO L93 Difference]: Finished difference Result 189 states and 483 transitions. [2022-03-15 22:16:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:16:25,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:16:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:25,649 INFO L225 Difference]: With dead ends: 189 [2022-03-15 22:16:25,649 INFO L226 Difference]: Without dead ends: 179 [2022-03-15 22:16:25,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 21 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 22:16:25,650 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:25,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-15 22:16:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2022-03-15 22:16:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.8473282442748094) internal successors, (373), 131 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:16:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 373 transitions. [2022-03-15 22:16:25,655 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 373 transitions. Word has length 18 [2022-03-15 22:16:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:25,655 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 373 transitions. [2022-03-15 22:16:25,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:16:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 373 transitions. [2022-03-15 22:16:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:16:25,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:25,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:25,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 22:16:25,656 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:25,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:25,657 INFO L85 PathProgramCache]: Analyzing trace with hash 582114191, now seen corresponding path program 4 times [2022-03-15 22:16:25,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:25,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663458059] [2022-03-15 22:16:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:25,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:25,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663458059] [2022-03-15 22:16:25,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663458059] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:25,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564126490] [2022-03-15 22:16:25,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:25,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:25,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:25,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:25,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:16:25,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:25,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:25,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:16:25,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:25,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:16:25,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564126490] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:25,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:16:25,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-03-15 22:16:25,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897097868] [2022-03-15 22:16:25,783 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:25,785 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:25,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 115 transitions. [2022-03-15 22:16:25,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:26,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:16:26,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:16:26,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:16:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 22:16:26,006 INFO L87 Difference]: Start difference. First operand 132 states and 373 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:26,046 INFO L93 Difference]: Finished difference Result 346 states and 961 transitions. [2022-03-15 22:16:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:16:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:16:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:26,049 INFO L225 Difference]: With dead ends: 346 [2022-03-15 22:16:26,049 INFO L226 Difference]: Without dead ends: 321 [2022-03-15 22:16:26,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 22:16:26,050 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:26,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-03-15 22:16:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 265. [2022-03-15 22:16:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.015151515151515) internal successors, (796), 264 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:16:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 796 transitions. [2022-03-15 22:16:26,072 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 796 transitions. Word has length 19 [2022-03-15 22:16:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:26,072 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 796 transitions. [2022-03-15 22:16:26,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 796 transitions. [2022-03-15 22:16:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:16:26,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:26,073 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 22:16:26,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:26,290 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 22:16:26,290 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1264937983, now seen corresponding path program 2 times [2022-03-15 22:16:26,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:26,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036731246] [2022-03-15 22:16:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:26,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:26,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036731246] [2022-03-15 22:16:26,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036731246] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:26,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623739105] [2022-03-15 22:16:26,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:26,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:26,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:26,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:16:26,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:26,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:26,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:16:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:26,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 22:16:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:26,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:26,485 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:26,486 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 13 treesize of output 17 [2022-03-15 22:16:26,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:26,528 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 17 treesize of output 21 [2022-03-15 22:16:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:26,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623739105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:26,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:26,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:16:26,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880534546] [2022-03-15 22:16:26,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:26,553 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:26,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 122 transitions. [2022-03-15 22:16:26,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:27,165 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3689#(or (<= (+ q1_back 1) q1_front) (not (= (select q1 q1_back) 0))), 3692#(and (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= q2_back q2_front))), 3687#(or (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 3688#(<= q1_back q1_front), 3686#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 3693#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front))), 3691#(or (<= 1 (select q2 q2_front)) (not (= (select q1 q1_back) 0))), 3690#(or g (not (= (select q1 q1_back) 0)))] [2022-03-15 22:16:27,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:27,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:16:27,166 INFO L87 Difference]: Start difference. First operand 265 states and 796 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 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 22:16:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:27,371 INFO L93 Difference]: Finished difference Result 335 states and 977 transitions. [2022-03-15 22:16:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:16:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 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 20 [2022-03-15 22:16:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:27,374 INFO L225 Difference]: With dead ends: 335 [2022-03-15 22:16:27,374 INFO L226 Difference]: Without dead ends: 335 [2022-03-15 22:16:27,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:16:27,374 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 80 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:27,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 16 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-03-15 22:16:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2022-03-15 22:16:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 2.996774193548387) internal successors, (929), 310 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have 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:16:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 929 transitions. [2022-03-15 22:16:27,385 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 929 transitions. Word has length 20 [2022-03-15 22:16:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:27,386 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 929 transitions. [2022-03-15 22:16:27,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 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 22:16:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 929 transitions. [2022-03-15 22:16:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:16:27,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:27,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:27,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:27,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:27,603 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -89522806, now seen corresponding path program 3 times [2022-03-15 22:16:27,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:27,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867471282] [2022-03-15 22:16:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:27,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:27,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867471282] [2022-03-15 22:16:27,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867471282] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:27,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506412870] [2022-03-15 22:16:27,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:27,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:27,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:16:28,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:16:28,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:28,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:16:28,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:28,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 22:16:28,323 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 11 [2022-03-15 22:16:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:28,658 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:28,659 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 50 treesize of output 52 [2022-03-15 22:16:28,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:28,914 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 33 treesize of output 35 [2022-03-15 22:16:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:29,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506412870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:29,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:29,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-03-15 22:16:29,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544354577] [2022-03-15 22:16:29,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:29,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:29,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 120 transitions. [2022-03-15 22:16:29,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:33,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [4815#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= (+ C y) x) (<= q1_back q1_front)) (or (<= x (+ C z)) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= z 0)) (or (<= i (+ z 1)) (<= q1_back q1_front)) (or (<= (+ C z) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= x (+ C y))) (or (<= q1_back q1_front) (= q2_back q2_front))), 4812#(and (or (<= q2_back q2_front) (<= (select q2 q2_front) N)) (or (<= (+ C y) x) (<= q2_back q2_front)) (or (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= q2_back q2_front) (<= N (select q2 q2_front))) (or (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= q2_back q2_front) (<= x (+ C y)))), 4811#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 4821#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= N (+ (select q2 q2_front) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 4813#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (= z 0) (<= x (+ C y))), 4817#(and (or (<= z x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N t) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= t N)) (or (<= x z) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 4818#(and (or (<= N (+ (select q2 q2_front) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 4820#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= j 1) (= z 0) (= q2_back q2_front)), 4814#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 4809#(and (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< i N)) (<= (+ q1_back 1) q1_front))), 4810#(and (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front))), 4816#(and (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< i N)) (<= (+ q1_back 1) q1_front))), 4819#(and (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front))), 4808#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= (+ C y) x) (<= q1_back q1_front)) (or (<= x (+ C z)) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (= z t) (<= q1_back q1_front)) (or (<= i (+ z 1)) (<= q1_back q1_front)) (or (<= (+ C z) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= x (+ C y))) (or (<= q1_back q1_front) (= q2_back q2_front)))] [2022-03-15 22:16:33,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:16:33,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:16:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:16:33,158 INFO L87 Difference]: Start difference. First operand 311 states and 929 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:37,784 INFO L93 Difference]: Finished difference Result 647 states and 1717 transitions. [2022-03-15 22:16:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:16:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 22:16:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:37,787 INFO L225 Difference]: With dead ends: 647 [2022-03-15 22:16:37,787 INFO L226 Difference]: Without dead ends: 598 [2022-03-15 22:16:37,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 43 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=527, Invalid=5023, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 22:16:37,788 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 141 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:37,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 19 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:16:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-03-15 22:16:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 305. [2022-03-15 22:16:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0032894736842106) internal successors, (913), 304 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have 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:16:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 913 transitions. [2022-03-15 22:16:37,796 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 913 transitions. Word has length 21 [2022-03-15 22:16:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:37,796 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 913 transitions. [2022-03-15 22:16:37,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 913 transitions. [2022-03-15 22:16:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:16:37,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:37,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:37,813 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 22:16:38,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:38,013 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -23128160, now seen corresponding path program 4 times [2022-03-15 22:16:38,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:38,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600014584] [2022-03-15 22:16:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:38,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:38,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600014584] [2022-03-15 22:16:38,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600014584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:38,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774108286] [2022-03-15 22:16:38,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:38,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:38,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:38,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:38,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:16:38,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:38,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:38,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:16:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:38,512 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 11 treesize of output 7 [2022-03-15 22:16:38,713 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 11 [2022-03-15 22:16:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:38,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:39,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:39,041 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 52 treesize of output 54 [2022-03-15 22:16:39,282 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:39,282 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 35 treesize of output 37 [2022-03-15 22:16:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:39,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774108286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:39,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:39,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 22:16:39,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788460011] [2022-03-15 22:16:39,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:39,386 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:39,396 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 136 transitions. [2022-03-15 22:16:39,396 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:43,365 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [6306#(and (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front))), 6304#(and (or (<= N (+ (select q2 q2_front) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 6293#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 6305#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= N (+ (select q2 q2_front) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 6295#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= (+ C y) x) (<= q1_back q1_front)) (or (<= x (+ C z)) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (= z t) (<= q1_back q1_front)) (or (<= i (+ z 1)) (<= q1_back q1_front)) (or (<= (+ C z) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= x (+ C y))) (or (<= q1_back q1_front) (= q2_back q2_front))), 6297#(and (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< i N)) (<= (+ q1_back 1) q1_front))), 6302#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= j 1) (= z 0) (= q2_back q2_front)), 6301#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (= z 0) (<= x (+ C y))), 6294#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 6296#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= (+ C y) x) (<= q1_back q1_front)) (or (<= x (+ C z)) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= z 0)) (or (<= i (+ z 1)) (<= q1_back q1_front)) (or (<= (+ C z) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= x (+ C y))) (or (<= q1_back q1_front) (= q2_back q2_front))), 6303#(and (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< 0 N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (<= (+ q1_back 1) q1_front) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 0 N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front))), 6300#(and (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (<= x y) (< y (+ x 1)) (= z 0)), 6298#(and (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ z 1) N) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (+ (- 1) (select q1 q1_front)) 0) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< i N)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= z x)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< i N)) (<= (+ q1_back 1) q1_front))), 6299#(and (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 1))) (+ N 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))))] [2022-03-15 22:16:43,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:16:43,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:43,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:16:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:16:43,366 INFO L87 Difference]: Start difference. First operand 305 states and 913 transitions. Second operand has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:16:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:48,704 INFO L93 Difference]: Finished difference Result 572 states and 1557 transitions. [2022-03-15 22:16:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:16:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 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 21 [2022-03-15 22:16:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:48,706 INFO L225 Difference]: With dead ends: 572 [2022-03-15 22:16:48,706 INFO L226 Difference]: Without dead ends: 566 [2022-03-15 22:16:48,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 48 SyntacticMatches, 12 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=520, Invalid=4592, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:16:48,708 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 124 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:48,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 20 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:16:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-03-15 22:16:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 317. [2022-03-15 22:16:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.962025316455696) internal successors, (936), 316 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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:16:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 936 transitions. [2022-03-15 22:16:48,716 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 936 transitions. Word has length 21 [2022-03-15 22:16:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:48,716 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 936 transitions. [2022-03-15 22:16:48,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:16:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 936 transitions. [2022-03-15 22:16:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:16:48,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:48,718 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:48,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:48,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:48,931 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1219128186, now seen corresponding path program 5 times [2022-03-15 22:16:48,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:48,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225638722] [2022-03-15 22:16:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:49,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:49,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225638722] [2022-03-15 22:16:49,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225638722] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:49,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859876923] [2022-03-15 22:16:49,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:16:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:49,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:49,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:49,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:16:49,291 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:16:49,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:49,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:16:49,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:49,459 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 11 treesize of output 7 [2022-03-15 22:16:49,546 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 11 treesize of output 7 [2022-03-15 22:16:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:49,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:49,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:49,778 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 50 treesize of output 52 [2022-03-15 22:16:49,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:49,957 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 33 treesize of output 35 [2022-03-15 22:16:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:50,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859876923] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:50,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:50,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-03-15 22:16:50,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196447909] [2022-03-15 22:16:50,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:50,051 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:50,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 22:16:50,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:53,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [7728#(and (or (not (= (select q1 q1_back) 1)) (<= (+ z 1) N) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= z x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= 0 z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= y x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= x z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (<= x y))), 7719#(and (or (<= q2_back q2_front) (<= (select q2 q2_front) N)) (or (<= (+ C y) x) (<= q2_back q2_front)) (or (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= q2_back q2_front) (<= N (select q2 q2_front))) (or (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= q2_back q2_front) (<= x (+ C y)))), 7720#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (= z 0) (<= x (+ C y))), 7726#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ z 1) N))), 7721#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 7724#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (<= q1_back q1_front)) (or (<= N (+ z 1)) (<= q1_back q1_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= z 0)) (or (<= (+ y (* 2 C)) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= q2_back q2_front)) (or (<= x (+ y (* 2 C))) (<= q1_back q1_front))), 7725#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (= (select q1 q1_front) 1) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= z 0) (= q2_back q2_front)), 7718#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 7723#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= j 1) (= z 0) (= q2_back q2_front)), 7722#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (<= q1_back q1_front)) (or (<= N (+ z 1)) (<= q1_back q1_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= (+ y (* 2 C)) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= q2_back q2_front)) (or (= (+ (* (- 1) t) z) 0) (<= q1_back q1_front)) (or (<= x (+ y (* 2 C))) (<= q1_back q1_front))), 7727#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ z 1) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 7729#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= z x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= y x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= x z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= z 0)))] [2022-03-15 22:16:53,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:16:53,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:16:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:16:53,298 INFO L87 Difference]: Start difference. First operand 317 states and 936 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:55,211 INFO L93 Difference]: Finished difference Result 671 states and 1781 transitions. [2022-03-15 22:16:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:16:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 22:16:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:55,214 INFO L225 Difference]: With dead ends: 671 [2022-03-15 22:16:55,215 INFO L226 Difference]: Without dead ends: 658 [2022-03-15 22:16:55,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=408, Invalid=3252, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:16:55,216 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 136 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:55,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 23 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:16:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-03-15 22:16:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 353. [2022-03-15 22:16:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.8693181818181817) internal successors, (1010), 352 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have 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:16:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1010 transitions. [2022-03-15 22:16:55,235 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1010 transitions. Word has length 21 [2022-03-15 22:16:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:55,235 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1010 transitions. [2022-03-15 22:16:55,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1010 transitions. [2022-03-15 22:16:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:16:55,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:55,237 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:55,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:55,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:55,455 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1285522832, now seen corresponding path program 6 times [2022-03-15 22:16:55,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:55,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860658976] [2022-03-15 22:16:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:55,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:55,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860658976] [2022-03-15 22:16:55,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860658976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:55,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309085841] [2022-03-15 22:16:55,773 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:16:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:55,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:55,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:16:55,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:16:55,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:55,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 22:16:55,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:55,981 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 11 treesize of output 7 [2022-03-15 22:16:56,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 22:16:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:56,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:56,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:56,396 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 52 treesize of output 54 [2022-03-15 22:16:56,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:56,642 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 35 treesize of output 37 [2022-03-15 22:16:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:56,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309085841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:56,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:56,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 22:16:56,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703173452] [2022-03-15 22:16:56,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:56,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:56,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 148 transitions. [2022-03-15 22:16:56,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:00,537 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [9298#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 9304#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (<= q1_back q1_front)) (or (<= N (+ z 1)) (<= q1_back q1_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= z 0)) (or (<= (+ y (* 2 C)) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= q2_back q2_front)) (or (<= x (+ y (* 2 C))) (<= q1_back q1_front))), 9301#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (= z 0) (<= x (+ C y))), 9303#(and (or (<= (+ z 1) N) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (<= q1_back q1_front)) (or (<= N (+ z 1)) (<= q1_back q1_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= (+ y (* 2 C)) x) (<= q1_back q1_front)) (or (<= q1_back q1_front) (= q2_back q2_front)) (or (= (+ (* (- 1) t) z) 0) (<= q1_back q1_front)) (or (<= x (+ y (* 2 C))) (<= q1_back q1_front))), 9308#(and (or (not (= (select q1 q1_back) 1)) (<= (+ z 1) N) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= z x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= 0 z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= y x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= x z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (<= x y))), 9297#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 9306#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ z 1) N))), 9309#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= z x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= y x) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= x z) (<= N 0)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= N 0) (= z 0))), 9305#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (= (select q1 q1_front) 1) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= z 0) (= q2_back q2_front)), 9307#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ z 1) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 9300#(and (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z) N) (<= x (+ z (* 2 C))) (<= N (+ (select q2 q2_front) z)) (<= x y) (< y (+ x 1)) (= z 0)), 9302#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= (+ z (* 2 C)) x) (<= N (+ z 1)) (<= (+ z 1) N) (<= x (+ z (* 2 C))) (= j 1) (= z 0) (= q2_back q2_front)), 9299#(and (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 1))) (+ N 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1))) (or (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))))] [2022-03-15 22:17:00,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:17:00,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:17:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1628, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:17:00,538 INFO L87 Difference]: Start difference. First operand 353 states and 1010 transitions. Second operand has 26 states, 25 states have (on average 3.36) internal successors, (84), 25 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 22:17:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:02,879 INFO L93 Difference]: Finished difference Result 623 states and 1679 transitions. [2022-03-15 22:17:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:17:02,880 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.36) internal successors, (84), 25 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 21 [2022-03-15 22:17:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:02,882 INFO L225 Difference]: With dead ends: 623 [2022-03-15 22:17:02,882 INFO L226 Difference]: Without dead ends: 619 [2022-03-15 22:17:02,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=419, Invalid=3363, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:17:02,883 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:02,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 24 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:17:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-15 22:17:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 362. [2022-03-15 22:17:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.889196675900277) internal successors, (1043), 361 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1043 transitions. [2022-03-15 22:17:02,895 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1043 transitions. Word has length 21 [2022-03-15 22:17:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:02,895 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 1043 transitions. [2022-03-15 22:17:02,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.36) internal successors, (84), 25 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 22:17:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1043 transitions. [2022-03-15 22:17:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:17:02,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:02,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:02,913 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 22:17:03,112 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,SelfDestructingSolverStorable11 [2022-03-15 22:17:03,113 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash 887620106, now seen corresponding path program 7 times [2022-03-15 22:17:03,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:03,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132154227] [2022-03-15 22:17:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:03,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:03,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132154227] [2022-03-15 22:17:03,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132154227] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:03,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135741715] [2022-03-15 22:17:03,183 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:17:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:03,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:03,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:17:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:03,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:17:03,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:03,257 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 11 treesize of output 7 [2022-03-15 22:17:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:03,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:03,292 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:17:03,293 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 14 [2022-03-15 22:17:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:03,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135741715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:03,299 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:03,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:17:03,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785148022] [2022-03-15 22:17:03,299 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:03,301 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:03,310 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 135 transitions. [2022-03-15 22:17:03,310 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:03,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [10836#(or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))), 10840#(or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= q1_back q1_front)), 10838#(or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= (+ q1_back 2) q1_front)), 10839#(or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))), 10842#(or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)), 10841#(or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ q1_back 1) q1_front)), 10837#(or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ q1_back 1) q1_front) (not f))] [2022-03-15 22:17:03,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:17:03,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:17:03,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-03-15 22:17:03,968 INFO L87 Difference]: Start difference. First operand 362 states and 1043 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:04,414 INFO L93 Difference]: Finished difference Result 721 states and 1977 transitions. [2022-03-15 22:17:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 22:17:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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 22:17:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:04,417 INFO L225 Difference]: With dead ends: 721 [2022-03-15 22:17:04,417 INFO L226 Difference]: Without dead ends: 721 [2022-03-15 22:17:04,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:17:04,418 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 196 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:04,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 20 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-03-15 22:17:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 542. [2022-03-15 22:17:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.8946395563770797) internal successors, (1566), 541 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1566 transitions. [2022-03-15 22:17:04,428 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1566 transitions. Word has length 22 [2022-03-15 22:17:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:04,428 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 1566 transitions. [2022-03-15 22:17:04,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1566 transitions. [2022-03-15 22:17:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:17:04,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:04,429 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:04,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:04,643 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,SelfDestructingSolverStorable12 [2022-03-15 22:17:04,643 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash -505398399, now seen corresponding path program 8 times [2022-03-15 22:17:04,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:04,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515515619] [2022-03-15 22:17:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:04,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:04,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515515619] [2022-03-15 22:17:04,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515515619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:04,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376496222] [2022-03-15 22:17:04,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:04,683 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:04,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:17:04,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:04,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:04,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:17:04,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:04,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:04,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376496222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:04,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:04,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 22:17:04,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791847216] [2022-03-15 22:17:04,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:04,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:04,800 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 146 transitions. [2022-03-15 22:17:04,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:05,151 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:05,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 22:17:05,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 22:17:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:17:05,152 INFO L87 Difference]: Start difference. First operand 542 states and 1566 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:05,201 INFO L93 Difference]: Finished difference Result 952 states and 2713 transitions. [2022-03-15 22:17:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 22:17:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 22:17:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:05,205 INFO L225 Difference]: With dead ends: 952 [2022-03-15 22:17:05,205 INFO L226 Difference]: Without dead ends: 915 [2022-03-15 22:17:05,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 20 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:17:05,205 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:05,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 2 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:17:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-03-15 22:17:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 643. [2022-03-15 22:17:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.02803738317757) internal successors, (1944), 642 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1944 transitions. [2022-03-15 22:17:05,219 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1944 transitions. Word has length 22 [2022-03-15 22:17:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:05,219 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 1944 transitions. [2022-03-15 22:17:05,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1944 transitions. [2022-03-15 22:17:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:17:05,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:05,220 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:05,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:05,436 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,SelfDestructingSolverStorable13 [2022-03-15 22:17:05,437 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1470238531, now seen corresponding path program 9 times [2022-03-15 22:17:05,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:05,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667318277] [2022-03-15 22:17:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:05,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:05,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667318277] [2022-03-15 22:17:05,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667318277] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:05,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254063831] [2022-03-15 22:17:05,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:05,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:05,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:05,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:17:05,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:17:05,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:05,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:17:05,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:05,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:05,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254063831] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:05,579 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:05,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 22:17:05,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1981809600] [2022-03-15 22:17:05,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:05,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:05,592 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 144 transitions. [2022-03-15 22:17:05,592 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:05,817 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 6 treesize of output 4 [2022-03-15 22:17:05,857 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:05,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 22:17:05,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 22:17:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:17:05,858 INFO L87 Difference]: Start difference. First operand 643 states and 1944 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:05,933 INFO L93 Difference]: Finished difference Result 1420 states and 4345 transitions. [2022-03-15 22:17:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 22:17:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 22:17:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:05,938 INFO L225 Difference]: With dead ends: 1420 [2022-03-15 22:17:05,938 INFO L226 Difference]: Without dead ends: 1379 [2022-03-15 22:17:05,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:17:05,942 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:05,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-03-15 22:17:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1155. [2022-03-15 22:17:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 3.236568457538995) internal successors, (3735), 1154 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 3735 transitions. [2022-03-15 22:17:05,963 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 3735 transitions. Word has length 23 [2022-03-15 22:17:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:05,964 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 3735 transitions. [2022-03-15 22:17:05,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 3735 transitions. [2022-03-15 22:17:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:17:05,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:05,966 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:05,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:06,185 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,SelfDestructingSolverStorable14 [2022-03-15 22:17:06,185 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2073043789, now seen corresponding path program 10 times [2022-03-15 22:17:06,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:06,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59070289] [2022-03-15 22:17:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:17:06,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:06,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59070289] [2022-03-15 22:17:06,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59070289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:06,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303743311] [2022-03-15 22:17:06,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:06,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:06,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:17:06,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:06,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:06,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:17:06,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:06,339 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 5 treesize of output 3 [2022-03-15 22:17:06,371 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 35 treesize of output 27 [2022-03-15 22:17:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:17:06,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:06,430 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:17:06,430 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 13 treesize of output 12 [2022-03-15 22:17:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 22:17:06,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303743311] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:06,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:06,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2022-03-15 22:17:06,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184211744] [2022-03-15 22:17:06,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:06,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:06,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 149 transitions. [2022-03-15 22:17:06,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:06,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [19068#(or (= (+ q2_front 1) q2_back) (not g) (<= q2_back q2_front)), 19071#(not f), 19070#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 19072#(or (not f) (= q2_back q2_front)), 19069#(or (= (+ q2_front 1) q2_back) (<= q2_back q2_front))] [2022-03-15 22:17:06,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:17:06,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:17:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:17:06,970 INFO L87 Difference]: Start difference. First operand 1155 states and 3735 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:07,282 INFO L93 Difference]: Finished difference Result 2290 states and 7124 transitions. [2022-03-15 22:17:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 22:17:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 22:17:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:07,290 INFO L225 Difference]: With dead ends: 2290 [2022-03-15 22:17:07,290 INFO L226 Difference]: Without dead ends: 2267 [2022-03-15 22:17:07,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 29 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:17:07,291 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:07,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 9 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-03-15 22:17:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1347. [2022-03-15 22:17:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1346 states have (on average 3.2199108469539377) internal successors, (4334), 1346 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 4334 transitions. [2022-03-15 22:17:07,318 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 4334 transitions. Word has length 24 [2022-03-15 22:17:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:07,318 INFO L470 AbstractCegarLoop]: Abstraction has 1347 states and 4334 transitions. [2022-03-15 22:17:07,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 4334 transitions. [2022-03-15 22:17:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:17:07,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:07,321 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:07,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:07,537 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,SelfDestructingSolverStorable15 [2022-03-15 22:17:07,537 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1453789155, now seen corresponding path program 11 times [2022-03-15 22:17:07,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:07,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566466648] [2022-03-15 22:17:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:07,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:07,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566466648] [2022-03-15 22:17:07,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566466648] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:07,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076066231] [2022-03-15 22:17:07,593 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:07,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:07,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:07,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:07,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 22:17:07,626 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:17:07,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:07,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 22:17:07,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:07,665 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 5 treesize of output 3 [2022-03-15 22:17:07,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:07,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-03-15 22:17:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:07,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:07,870 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:17:07,870 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 13 treesize of output 12 [2022-03-15 22:17:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:07,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076066231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:07,907 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:07,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2022-03-15 22:17:07,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105265584] [2022-03-15 22:17:07,907 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:07,909 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:07,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 161 transitions. [2022-03-15 22:17:07,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:08,564 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [24240#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 24241#(or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 24242#(not f), 24243#(or (not f) (= q2_back q2_front)), 24239#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))] [2022-03-15 22:17:08,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:17:08,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:17:08,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:17:08,565 INFO L87 Difference]: Start difference. First operand 1347 states and 4334 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:09,131 INFO L93 Difference]: Finished difference Result 2212 states and 6857 transitions. [2022-03-15 22:17:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:17:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 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 24 [2022-03-15 22:17:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:09,139 INFO L225 Difference]: With dead ends: 2212 [2022-03-15 22:17:09,139 INFO L226 Difference]: Without dead ends: 2189 [2022-03-15 22:17:09,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 17 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:17:09,141 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 176 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:09,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 11 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-03-15 22:17:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1477. [2022-03-15 22:17:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1476 states have (on average 3.1890243902439024) internal successors, (4707), 1476 states have internal predecessors, (4707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4707 transitions. [2022-03-15 22:17:09,169 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4707 transitions. Word has length 24 [2022-03-15 22:17:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:09,169 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 4707 transitions. [2022-03-15 22:17:09,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4707 transitions. [2022-03-15 22:17:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:17:09,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:09,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:09,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:09,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 22:17:09,389 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash 735469445, now seen corresponding path program 12 times [2022-03-15 22:17:09,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:09,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726450178] [2022-03-15 22:17:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:09,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:09,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726450178] [2022-03-15 22:17:09,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726450178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:09,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375178371] [2022-03-15 22:17:09,457 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:17:09,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:09,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:09,458 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:17:09,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:17:09,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:09,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:17:09,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:09,519 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 5 treesize of output 3 [2022-03-15 22:17:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:09,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:09,652 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:17:09,652 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 14 [2022-03-15 22:17:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:09,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375178371] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:09,685 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:09,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-03-15 22:17:09,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575023364] [2022-03-15 22:17:09,685 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:09,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:09,699 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 153 transitions. [2022-03-15 22:17:09,699 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:10,285 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [29607#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 29606#(or (not (= 0 (select q2 (+ q2_front 1)))) (<= q2_back q2_front)), 29604#(or (not f) (= q2_back q2_front)), 29605#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (<= q2_back q2_front))] [2022-03-15 22:17:10,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:17:10,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:17:10,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:17:10,286 INFO L87 Difference]: Start difference. First operand 1477 states and 4707 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:10,785 INFO L93 Difference]: Finished difference Result 2466 states and 7661 transitions. [2022-03-15 22:17:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 22:17:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 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 22:17:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:10,794 INFO L225 Difference]: With dead ends: 2466 [2022-03-15 22:17:10,794 INFO L226 Difference]: Without dead ends: 2466 [2022-03-15 22:17:10,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:17:10,795 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:10,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 11 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:17:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2022-03-15 22:17:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1430. [2022-03-15 22:17:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 3.205738278516445) internal successors, (4581), 1429 states have internal predecessors, (4581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 4581 transitions. [2022-03-15 22:17:10,821 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 4581 transitions. Word has length 24 [2022-03-15 22:17:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:10,821 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 4581 transitions. [2022-03-15 22:17:10,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 4581 transitions. [2022-03-15 22:17:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:17:10,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:10,823 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:10,839 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:17:11,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:11,036 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash 801864091, now seen corresponding path program 13 times [2022-03-15 22:17:11,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:11,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99825222] [2022-03-15 22:17:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:11,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:11,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99825222] [2022-03-15 22:17:11,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99825222] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:11,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53920857] [2022-03-15 22:17:11,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:17:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:11,110 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:17:11,111 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:17:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:11,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:17:11,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:11,160 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 5 treesize of output 3 [2022-03-15 22:17:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:11,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:11,218 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:17:11,218 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 14 [2022-03-15 22:17:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:17:11,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53920857] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:11,268 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:11,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2022-03-15 22:17:11,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474378129] [2022-03-15 22:17:11,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:11,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:11,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 171 transitions. [2022-03-15 22:17:11,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:11,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [35121#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 35124#(or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 35123#(or (not f) (= q2_back q2_front)), 35122#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)))] [2022-03-15 22:17:11,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:17:11,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:17:11,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:17:11,689 INFO L87 Difference]: Start difference. First operand 1430 states and 4581 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:12,033 INFO L93 Difference]: Finished difference Result 2386 states and 7448 transitions. [2022-03-15 22:17:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:17:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 22:17:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:12,042 INFO L225 Difference]: With dead ends: 2386 [2022-03-15 22:17:12,042 INFO L226 Difference]: Without dead ends: 2386 [2022-03-15 22:17:12,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 22 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:17:12,043 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 108 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:12,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 11 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2022-03-15 22:17:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1504. [2022-03-15 22:17:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 3.2042581503659346) internal successors, (4816), 1503 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4816 transitions. [2022-03-15 22:17:12,069 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 4816 transitions. Word has length 24 [2022-03-15 22:17:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:12,070 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 4816 transitions. [2022-03-15 22:17:12,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 4816 transitions. [2022-03-15 22:17:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:17:12,072 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:12,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:12,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:12,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:12,288 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash -808046596, now seen corresponding path program 14 times [2022-03-15 22:17:12,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:12,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056637819] [2022-03-15 22:17:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:12,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:12,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056637819] [2022-03-15 22:17:12,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056637819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:12,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965723824] [2022-03-15 22:17:12,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:12,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:12,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:12,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:12,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:17:12,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:12,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:12,815 WARN L261 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 22:17:12,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:13,166 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:17:13,166 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 17 [2022-03-15 22:17:13,246 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:17:13,246 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 33 treesize of output 17 [2022-03-15 22:17:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:13,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:13,680 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:13,680 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 70 treesize of output 88 [2022-03-15 22:17:14,287 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:14,288 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 57 treesize of output 75 [2022-03-15 22:17:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:14,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965723824] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:14,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:14,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:17:14,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444175717] [2022-03-15 22:17:14,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:14,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:14,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 149 transitions. [2022-03-15 22:17:14,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:20,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [40736#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 40734#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 40739#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 40738#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 40745#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 40741#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 40732#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 40730#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 40729#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 40744#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 40743#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 40740#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= q2_back q2_front)) (or (<= (+ t (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N))), 40737#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 40735#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 40742#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 40731#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 40733#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0))] [2022-03-15 22:17:20,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:17:20,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:17:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2949, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:17:20,196 INFO L87 Difference]: Start difference. First operand 1504 states and 4816 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:32,234 INFO L93 Difference]: Finished difference Result 2669 states and 7784 transitions. [2022-03-15 22:17:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 22:17:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 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 25 [2022-03-15 22:17:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:32,256 INFO L225 Difference]: With dead ends: 2669 [2022-03-15 22:17:32,256 INFO L226 Difference]: Without dead ends: 2649 [2022-03-15 22:17:32,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1175, Invalid=11481, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 22:17:32,259 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 226 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:32,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 24 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:17:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2022-03-15 22:17:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1531. [2022-03-15 22:17:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 3.1862745098039214) internal successors, (4875), 1530 states have internal predecessors, (4875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 4875 transitions. [2022-03-15 22:17:32,332 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 4875 transitions. Word has length 25 [2022-03-15 22:17:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:32,333 INFO L470 AbstractCegarLoop]: Abstraction has 1531 states and 4875 transitions. [2022-03-15 22:17:32,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 4875 transitions. [2022-03-15 22:17:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:17:32,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:32,335 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:32,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 22:17:32,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:32,536 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash -741651950, now seen corresponding path program 15 times [2022-03-15 22:17:32,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:32,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755394676] [2022-03-15 22:17:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:33,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:33,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755394676] [2022-03-15 22:17:33,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755394676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:33,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350295835] [2022-03-15 22:17:33,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:33,092 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:33,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:17:33,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:17:33,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:33,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 22:17:33,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:33,611 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:17:33,611 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 17 [2022-03-15 22:17:33,792 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:17:33,792 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 33 treesize of output 17 [2022-03-15 22:17:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:33,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:34,324 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:34,325 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 70 treesize of output 88 [2022-03-15 22:17:34,975 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:34,975 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 57 treesize of output 75 [2022-03-15 22:17:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:35,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350295835] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:35,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:35,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:17:35,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1359457717] [2022-03-15 22:17:35,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:35,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:35,137 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 151 transitions. [2022-03-15 22:17:35,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:42,230 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [46775#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 46777#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 46788#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 46786#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 46789#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 46784#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 46779#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 46781#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 46778#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 46787#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= q2_back q2_front)) (or (<= (+ t (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N))), 46782#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 46783#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 46773#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 46776#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 46785#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 46774#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 46780#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))))] [2022-03-15 22:17:42,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:17:42,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:17:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2942, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:17:42,232 INFO L87 Difference]: Start difference. First operand 1531 states and 4875 transitions. Second operand has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:54,841 INFO L93 Difference]: Finished difference Result 2719 states and 7879 transitions. [2022-03-15 22:17:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 22:17:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 22:17:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:54,847 INFO L225 Difference]: With dead ends: 2719 [2022-03-15 22:17:54,847 INFO L226 Difference]: Without dead ends: 2669 [2022-03-15 22:17:54,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2989 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1164, Invalid=11492, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 22:17:54,850 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 190 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:54,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 24 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:17:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2022-03-15 22:17:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 1523. [2022-03-15 22:17:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 3.1918528252299607) internal successors, (4858), 1522 states have internal predecessors, (4858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 4858 transitions. [2022-03-15 22:17:54,893 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 4858 transitions. Word has length 25 [2022-03-15 22:17:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:54,893 INFO L470 AbstractCegarLoop]: Abstraction has 1523 states and 4858 transitions. [2022-03-15 22:17:54,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 4858 transitions. [2022-03-15 22:17:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:17:54,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:54,896 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:54,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:55,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:55,117 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1469896230, now seen corresponding path program 16 times [2022-03-15 22:17:55,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:55,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723764897] [2022-03-15 22:17:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:55,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:55,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723764897] [2022-03-15 22:17:55,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723764897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:55,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608514559] [2022-03-15 22:17:55,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:55,656 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:17:55,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:55,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:55,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:17:55,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:56,133 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:17:56,134 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 33 treesize of output 17 [2022-03-15 22:17:56,298 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:17:56,298 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 30 treesize of output 14 [2022-03-15 22:17:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:56,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:56,891 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:56,892 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 70 treesize of output 88 [2022-03-15 22:17:57,396 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:57,397 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 57 treesize of output 75 [2022-03-15 22:17:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:57,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608514559] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:57,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:57,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:17:57,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379343630] [2022-03-15 22:17:57,479 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:57,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:57,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 161 transitions. [2022-03-15 22:17:57,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:04,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [52852#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 52856#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 52862#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 52865#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 52855#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 52860#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 52857#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 52853#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 52863#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 52858#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 52864#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 52868#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 52851#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 52861#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 52867#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 52859#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x)) (or (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y)))), 52866#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 52854#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))))] [2022-03-15 22:18:04,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:18:04,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:18:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3059, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:18:04,595 INFO L87 Difference]: Start difference. First operand 1523 states and 4858 transitions. Second operand has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:18,980 INFO L93 Difference]: Finished difference Result 2761 states and 7962 transitions. [2022-03-15 22:18:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 22:18:18,980 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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 25 [2022-03-15 22:18:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:18,992 INFO L225 Difference]: With dead ends: 2761 [2022-03-15 22:18:18,992 INFO L226 Difference]: Without dead ends: 2721 [2022-03-15 22:18:18,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3488 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1257, Invalid=13749, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 22:18:18,993 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 238 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:18,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 29 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:18:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2022-03-15 22:18:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1537. [2022-03-15 22:18:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 3.1822916666666665) internal successors, (4888), 1536 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 4888 transitions. [2022-03-15 22:18:19,021 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 4888 transitions. Word has length 25 [2022-03-15 22:18:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:19,021 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 4888 transitions. [2022-03-15 22:18:19,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 4888 transitions. [2022-03-15 22:18:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:18:19,023 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:19,023 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:19,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:19,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:19,239 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1536290876, now seen corresponding path program 17 times [2022-03-15 22:18:19,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:19,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556760737] [2022-03-15 22:18:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:19,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:19,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556760737] [2022-03-15 22:18:19,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556760737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:19,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631263653] [2022-03-15 22:18:19,773 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:19,774 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:19,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:18:19,822 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:18:19,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:19,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 22:18:19,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:20,183 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:18:20,184 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 27 treesize of output 15 [2022-03-15 22:18:20,377 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:18:20,380 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 26 treesize of output 14 [2022-03-15 22:18:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:20,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:20,843 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:18:20,843 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 70 treesize of output 88 [2022-03-15 22:18:21,434 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:18:21,435 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 62 treesize of output 78 [2022-03-15 22:18:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:21,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631263653] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:21,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:21,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:18:21,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759171575] [2022-03-15 22:18:21,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:21,571 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:21,584 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 163 transitions. [2022-03-15 22:18:21,585 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:28,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [59033#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 59021#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 59032#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 59026#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 59023#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 59034#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 59028#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 59020#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 59019#(and (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))), 59031#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 59029#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 59024#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 59030#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 59025#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 59018#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1))))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (< q2_front q2_back)))), 59022#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 59027#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 59035#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 22:18:28,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:18:28,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:18:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:18:28,452 INFO L87 Difference]: Start difference. First operand 1537 states and 4888 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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 22:18:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:40,727 INFO L93 Difference]: Finished difference Result 2729 states and 7895 transitions. [2022-03-15 22:18:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:18:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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 25 [2022-03-15 22:18:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:40,733 INFO L225 Difference]: With dead ends: 2729 [2022-03-15 22:18:40,733 INFO L226 Difference]: Without dead ends: 2691 [2022-03-15 22:18:40,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 57 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3193 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1089, Invalid=12953, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:18:40,734 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 224 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:40,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 28 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:18:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2022-03-15 22:18:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 1533. [2022-03-15 22:18:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 3.1840731070496084) internal successors, (4878), 1532 states have internal predecessors, (4878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 4878 transitions. [2022-03-15 22:18:40,760 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 4878 transitions. Word has length 25 [2022-03-15 22:18:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:40,760 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 4878 transitions. [2022-03-15 22:18:40,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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 22:18:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 4878 transitions. [2022-03-15 22:18:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:18:40,763 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:40,763 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:40,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:40,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:40,979 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -700442394, now seen corresponding path program 18 times [2022-03-15 22:18:40,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:40,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265415768] [2022-03-15 22:18:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:41,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:41,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265415768] [2022-03-15 22:18:41,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265415768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:41,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832566088] [2022-03-15 22:18:41,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:41,525 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:18:41,562 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:18:41,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:41,564 WARN L261 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 22:18:41,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:42,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:42,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:42,254 INFO L353 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-03-15 22:18:42,254 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 30 treesize of output 36 [2022-03-15 22:18:42,606 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:18:42,606 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 24 treesize of output 12 [2022-03-15 22:18:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:42,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:43,361 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:18:43,361 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 90 treesize of output 100 [2022-03-15 22:18:44,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:44,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:44,543 INFO L353 Elim1Store]: treesize reduction 31, result has 52.3 percent of original size [2022-03-15 22:18:44,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 71 treesize of output 86 [2022-03-15 22:18:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:44,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832566088] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:44,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:44,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2022-03-15 22:18:44,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152108069] [2022-03-15 22:18:44,892 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:44,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:44,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 181 transitions. [2022-03-15 22:18:44,912 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:53,626 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [65145#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 65144#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 65159#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 65150#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 65153#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 65156#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 65148#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= x y) (<= (+ (* 3 C) z) x) (< y (+ x 1)) (= z 0)), 65147#(and (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 65151#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 65149#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 65155#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 65161#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 65158#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 65154#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 65152#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 65162#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 65146#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 65160#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 65157#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)))] [2022-03-15 22:18:53,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:18:53,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:18:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3957, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:18:53,627 INFO L87 Difference]: Start difference. First operand 1533 states and 4878 transitions. Second operand has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 35 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:08,456 INFO L93 Difference]: Finished difference Result 2616 states and 7642 transitions. [2022-03-15 22:19:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 22:19:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 35 states have internal predecessors, (109), 0 states have call successors, (0), 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 25 [2022-03-15 22:19:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:08,461 INFO L225 Difference]: With dead ends: 2616 [2022-03-15 22:19:08,461 INFO L226 Difference]: Without dead ends: 2610 [2022-03-15 22:19:08,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3210 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1196, Invalid=13566, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 22:19:08,463 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 196 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 3418 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:08,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 31 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3418 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:19:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-03-15 22:19:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1545. [2022-03-15 22:19:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 3.1742227979274613) internal successors, (4901), 1544 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 4901 transitions. [2022-03-15 22:19:08,500 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 4901 transitions. Word has length 25 [2022-03-15 22:19:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:08,500 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 4901 transitions. [2022-03-15 22:19:08,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 35 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 4901 transitions. [2022-03-15 22:19:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:19:08,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:08,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:08,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:08,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:19:08,731 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -203257802, now seen corresponding path program 19 times [2022-03-15 22:19:08,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:08,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035699311] [2022-03-15 22:19:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:09,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:09,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035699311] [2022-03-15 22:19:09,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035699311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:09,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118147202] [2022-03-15 22:19:09,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:09,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:09,255 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:09,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:19:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:09,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:19:09,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:09,655 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:19:09,656 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 17 [2022-03-15 22:19:09,799 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:19:09,800 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 24 treesize of output 12 [2022-03-15 22:19:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:09,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:10,362 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:10,363 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 70 treesize of output 88 [2022-03-15 22:19:10,773 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:10,774 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 57 treesize of output 75 [2022-03-15 22:19:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:10,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118147202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:10,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:10,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:19:10,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358340730] [2022-03-15 22:19:10,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:10,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:10,943 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 22:19:10,943 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:16,304 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [71169#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 71172#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 71180#(and (or (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y)))), 71166#(and (or (<= z x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N t) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= t N)) (or (<= x z) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 71168#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 71167#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 71165#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 71177#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 71173#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 71174#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 71179#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 71175#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 71171#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 71170#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 71181#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 71178#(and (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j t))) (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 71176#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)))] [2022-03-15 22:19:16,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:19:16,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:19:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:19:16,305 INFO L87 Difference]: Start difference. First operand 1545 states and 4901 transitions. Second operand has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:30,299 INFO L93 Difference]: Finished difference Result 2743 states and 7926 transitions. [2022-03-15 22:19:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 22:19:30,300 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 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 25 [2022-03-15 22:19:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:30,327 INFO L225 Difference]: With dead ends: 2743 [2022-03-15 22:19:30,328 INFO L226 Difference]: Without dead ends: 2703 [2022-03-15 22:19:30,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1197, Invalid=10793, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:19:30,329 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 247 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:30,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 15 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:19:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-03-15 22:19:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1560. [2022-03-15 22:19:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1559 states have (on average 3.1642078255291852) internal successors, (4933), 1559 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 4933 transitions. [2022-03-15 22:19:30,365 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 4933 transitions. Word has length 25 [2022-03-15 22:19:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:30,365 INFO L470 AbstractCegarLoop]: Abstraction has 1560 states and 4933 transitions. [2022-03-15 22:19:30,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 4933 transitions. [2022-03-15 22:19:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:19:30,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:30,367 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:30,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:30,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 22:19:30,578 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash -136863156, now seen corresponding path program 20 times [2022-03-15 22:19:30,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:30,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256220952] [2022-03-15 22:19:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:31,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:31,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256220952] [2022-03-15 22:19:31,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256220952] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:31,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490839737] [2022-03-15 22:19:31,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:31,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:31,074 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:31,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:19:31,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:31,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:31,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 22:19:31,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:31,482 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:19:31,482 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 33 treesize of output 17 [2022-03-15 22:19:31,664 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:19:31,664 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 30 treesize of output 14 [2022-03-15 22:19:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:31,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:32,104 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:32,105 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 70 treesize of output 88 [2022-03-15 22:19:32,460 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:32,460 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 57 treesize of output 75 [2022-03-15 22:19:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:32,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490839737] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:32,648 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:32,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:19:32,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328774157] [2022-03-15 22:19:32,648 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:32,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:32,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 22:19:32,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:38,796 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [77345#(and (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j t))) (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 77347#(and (or (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y)))), 77346#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 77348#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 77336#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 77344#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 77335#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 77339#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 77349#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 77350#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 77343#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 77340#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 77337#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 77342#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 77338#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 77341#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y)))] [2022-03-15 22:19:38,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:19:38,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:19:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2802, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 22:19:38,798 INFO L87 Difference]: Start difference. First operand 1560 states and 4933 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:49,564 INFO L93 Difference]: Finished difference Result 2858 states and 8242 transitions. [2022-03-15 22:19:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 22:19:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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 25 [2022-03-15 22:19:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:49,569 INFO L225 Difference]: With dead ends: 2858 [2022-03-15 22:19:49,569 INFO L226 Difference]: Without dead ends: 2816 [2022-03-15 22:19:49,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1220, Invalid=10552, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 22:19:49,570 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 224 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:49,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 14 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:19:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2022-03-15 22:19:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 1554. [2022-03-15 22:19:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 3.168061815840309) internal successors, (4920), 1553 states have internal predecessors, (4920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 4920 transitions. [2022-03-15 22:19:49,597 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 4920 transitions. Word has length 25 [2022-03-15 22:19:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:49,597 INFO L470 AbstractCegarLoop]: Abstraction has 1554 states and 4920 transitions. [2022-03-15 22:19:49,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 4920 transitions. [2022-03-15 22:19:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:19:49,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:49,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:49,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 22:19:49,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 22:19:49,816 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1953801818, now seen corresponding path program 21 times [2022-03-15 22:19:49,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:49,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679996537] [2022-03-15 22:19:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:50,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:50,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679996537] [2022-03-15 22:19:50,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679996537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:50,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924155770] [2022-03-15 22:19:50,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:50,304 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:50,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:19:50,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:19:50,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:50,342 WARN L261 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 22:19:50,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:50,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:50,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:50,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:50,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2022-03-15 22:19:50,943 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:19:50,943 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 42 treesize of output 26 [2022-03-15 22:19:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:51,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:51,721 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:51,721 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 70 treesize of output 88 [2022-03-15 22:19:52,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:52,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:52,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:52,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:52,341 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 53 treesize of output 65 [2022-03-15 22:19:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:52,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924155770] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:52,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:52,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 43 [2022-03-15 22:19:52,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014067761] [2022-03-15 22:19:52,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:52,572 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:52,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 155 transitions. [2022-03-15 22:19:52,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:58,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [83629#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 83622#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 83618#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 83617#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x)) (or (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y)))), 83624#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 83612#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 83621#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 83616#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 83620#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 83628#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 83631#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 83630#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 83615#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 83623#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 83626#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 83627#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 83613#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 83619#(and (or (<= z x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N t) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= t N)) (or (<= x z) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 83625#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 83614#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))))] [2022-03-15 22:19:58,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:19:58,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:58,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:19:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3822, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:19:58,059 INFO L87 Difference]: Start difference. First operand 1554 states and 4920 transitions. Second operand has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:10,842 INFO L93 Difference]: Finished difference Result 2809 states and 8078 transitions. [2022-03-15 22:20:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 22:20:10,842 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 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 25 [2022-03-15 22:20:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:10,846 INFO L225 Difference]: With dead ends: 2809 [2022-03-15 22:20:10,846 INFO L226 Difference]: Without dead ends: 2771 [2022-03-15 22:20:10,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1209, Invalid=14291, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:20:10,848 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 244 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 3525 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:10,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 20 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3525 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:20:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2022-03-15 22:20:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1571. [2022-03-15 22:20:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 3.157324840764331) internal successors, (4957), 1570 states have internal predecessors, (4957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 4957 transitions. [2022-03-15 22:20:10,871 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 4957 transitions. Word has length 25 [2022-03-15 22:20:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:10,871 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 4957 transitions. [2022-03-15 22:20:10,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 4957 transitions. [2022-03-15 22:20:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:20:10,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:10,874 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:10,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:11,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:11,075 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1887407172, now seen corresponding path program 22 times [2022-03-15 22:20:11,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:11,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387415748] [2022-03-15 22:20:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:11,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:11,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387415748] [2022-03-15 22:20:11,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387415748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:11,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618948000] [2022-03-15 22:20:11,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:11,551 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:11,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:20:11,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:11,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:11,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:20:11,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:11,823 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:20:11,823 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 15 [2022-03-15 22:20:12,015 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:20:12,015 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 12 [2022-03-15 22:20:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:12,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:12,448 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:20:12,448 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 70 treesize of output 88 [2022-03-15 22:20:12,770 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:20:12,770 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 57 treesize of output 75 [2022-03-15 22:20:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:12,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618948000] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:12,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:12,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:20:12,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196252845] [2022-03-15 22:20:12,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:12,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:12,896 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 155 transitions. [2022-03-15 22:20:12,897 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:19,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [89895#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 89892#(and (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))), 89902#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 89904#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 89899#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 89897#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 89887#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1))))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (< q2_front q2_back)))), 89900#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 89891#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 89893#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 89888#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 89903#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 89894#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 89889#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 89896#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 89905#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 89901#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 89890#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 89898#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))))] [2022-03-15 22:20:19,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:20:19,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:19,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:20:19,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3189, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:20:19,382 INFO L87 Difference]: Start difference. First operand 1571 states and 4957 transitions. Second operand has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:32,528 INFO L93 Difference]: Finished difference Result 2780 states and 8017 transitions. [2022-03-15 22:20:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 22:20:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 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 25 [2022-03-15 22:20:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:32,533 INFO L225 Difference]: With dead ends: 2780 [2022-03-15 22:20:32,533 INFO L226 Difference]: Without dead ends: 2746 [2022-03-15 22:20:32,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=988, Invalid=12584, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:20:32,534 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 217 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:32,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 21 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:20:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-03-15 22:20:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1567. [2022-03-15 22:20:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 3.158365261813538) internal successors, (4946), 1566 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 4946 transitions. [2022-03-15 22:20:32,560 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 4946 transitions. Word has length 25 [2022-03-15 22:20:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:32,560 INFO L470 AbstractCegarLoop]: Abstraction has 1567 states and 4946 transitions. [2022-03-15 22:20:32,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 4946 transitions. [2022-03-15 22:20:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:20:32,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:32,563 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:32,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:32,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 22:20:32,781 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 170826854, now seen corresponding path program 23 times [2022-03-15 22:20:32,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:32,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659425419] [2022-03-15 22:20:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:33,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:33,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659425419] [2022-03-15 22:20:33,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659425419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:33,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393407535] [2022-03-15 22:20:33,333 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:20:33,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:33,334 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:33,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 22:20:33,371 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:20:33,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:33,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 22:20:33,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:33,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:33,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:33,779 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 31 treesize of output 17 [2022-03-15 22:20:34,046 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:20:34,046 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 24 treesize of output 12 [2022-03-15 22:20:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:34,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:34,540 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:20:34,540 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 72 treesize of output 90 [2022-03-15 22:20:34,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:34,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:34,928 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-03-15 22:20:34,928 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 64 treesize of output 72 [2022-03-15 22:20:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:35,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393407535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:35,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:35,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 43 [2022-03-15 22:20:35,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703887183] [2022-03-15 22:20:35,098 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:35,100 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:35,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 171 transitions. [2022-03-15 22:20:35,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:41,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [96141#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 96135#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 96143#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 96137#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= x y) (<= (+ (* 3 C) z) x) (< y (+ x 1)) (= z 0)), 96132#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 96131#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 96125#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 96129#(and (or (<= (+ y (* 2 C)) x) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ z (* 2 C)) x) (<= q1_back q1_front)) (or (<= x (+ z (* 2 C))) (not (< q1_front q1_back))) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= x (+ y (* 2 C))) (not (< q1_front q1_back))) (or (<= i (+ 2 z)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 96134#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 96126#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1))))), 96139#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 96128#(and (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< 1 N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y))), 96136#(and (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 96130#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= x (+ C y)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ C y) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ C z) x) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 96138#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 96127#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= i z) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= y x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)))), 96142#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 96133#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 96140#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 22:20:41,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:20:41,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:20:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3715, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:20:41,568 INFO L87 Difference]: Start difference. First operand 1567 states and 4946 transitions. Second operand has 36 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:55,739 INFO L93 Difference]: Finished difference Result 2672 states and 7779 transitions. [2022-03-15 22:20:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 22:20:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 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 25 [2022-03-15 22:20:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:55,745 INFO L225 Difference]: With dead ends: 2672 [2022-03-15 22:20:55,745 INFO L226 Difference]: Without dead ends: 2666 [2022-03-15 22:20:55,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3050 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1129, Invalid=12443, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:20:55,751 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 190 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 3199 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:55,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 22 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 3199 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:20:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-03-15 22:20:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1552. [2022-03-15 22:20:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 3.1695680206318504) internal successors, (4916), 1551 states have internal predecessors, (4916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 4916 transitions. [2022-03-15 22:20:55,777 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 4916 transitions. Word has length 25 [2022-03-15 22:20:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:55,777 INFO L470 AbstractCegarLoop]: Abstraction has 1552 states and 4916 transitions. [2022-03-15 22:20:55,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 4916 transitions. [2022-03-15 22:20:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:20:55,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:55,779 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:55,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:55,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 22:20:55,991 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash -204489716, now seen corresponding path program 24 times [2022-03-15 22:20:55,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:55,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725306982] [2022-03-15 22:20:55,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:56,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:56,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725306982] [2022-03-15 22:20:56,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725306982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:56,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931724047] [2022-03-15 22:20:56,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:20:56,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:56,453 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:56,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 22:20:56,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:20:56,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:56,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 22:20:56,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:56,865 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:20:56,865 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 17 [2022-03-15 22:20:56,945 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:20:56,945 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 26 treesize of output 14 [2022-03-15 22:20:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:57,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:57,398 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:20:57,398 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 70 treesize of output 88 [2022-03-15 22:20:57,907 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:20:57,907 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 57 treesize of output 75 [2022-03-15 22:20:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:58,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931724047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:58,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:58,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:20:58,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498092276] [2022-03-15 22:20:58,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:58,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:58,054 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 159 transitions. [2022-03-15 22:20:58,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:02,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [102219#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)))), 102218#(and (<= N (+ 2 z)) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 102217#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 102215#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 102212#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 102220#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 102211#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 102223#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 102222#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 102216#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 102213#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 102221#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 102214#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 102210#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 102224#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)))] [2022-03-15 22:21:02,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:21:02,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:21:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2721, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 22:21:02,866 INFO L87 Difference]: Start difference. First operand 1552 states and 4916 transitions. Second operand has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:08,689 INFO L93 Difference]: Finished difference Result 2722 states and 7875 transitions. [2022-03-15 22:21:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:21:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 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 25 [2022-03-15 22:21:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:08,694 INFO L225 Difference]: With dead ends: 2722 [2022-03-15 22:21:08,694 INFO L226 Difference]: Without dead ends: 2710 [2022-03-15 22:21:08,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=886, Invalid=7486, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 22:21:08,695 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 217 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:08,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 28 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:21:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2022-03-15 22:21:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 1586. [2022-03-15 22:21:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 3.146372239747634) internal successors, (4987), 1585 states have internal predecessors, (4987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 4987 transitions. [2022-03-15 22:21:08,719 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 4987 transitions. Word has length 25 [2022-03-15 22:21:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:08,719 INFO L470 AbstractCegarLoop]: Abstraction has 1586 states and 4987 transitions. [2022-03-15 22:21:08,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 4987 transitions. [2022-03-15 22:21:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:21:08,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:08,722 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:08,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:08,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:08,931 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -138095070, now seen corresponding path program 25 times [2022-03-15 22:21:08,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:08,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618504508] [2022-03-15 22:21:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:09,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:09,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618504508] [2022-03-15 22:21:09,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618504508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:09,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829352036] [2022-03-15 22:21:09,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:21:09,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:09,475 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:09,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 22:21:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:09,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 22:21:09,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:09,855 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:21:09,855 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 33 treesize of output 17 [2022-03-15 22:21:09,967 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:21:09,967 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 33 treesize of output 17 [2022-03-15 22:21:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:10,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:10,322 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:10,322 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 70 treesize of output 88 [2022-03-15 22:21:10,702 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:10,702 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 57 treesize of output 75 [2022-03-15 22:21:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:10,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829352036] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:10,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:10,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:21:10,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683367984] [2022-03-15 22:21:10,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:10,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:10,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 161 transitions. [2022-03-15 22:21:10,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:15,698 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [108379#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 108378#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 108377#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)))), 108382#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 108388#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 108389#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 108384#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 108381#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 108386#(and (<= N (+ 2 z)) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 108385#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 108390#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 108387#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 108380#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 108391#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 108383#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front))] [2022-03-15 22:21:15,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:21:15,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:21:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2715, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 22:21:15,699 INFO L87 Difference]: Start difference. First operand 1586 states and 4987 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:20,550 INFO L93 Difference]: Finished difference Result 2768 states and 7977 transitions. [2022-03-15 22:21:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:21:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 22:21:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:20,555 INFO L225 Difference]: With dead ends: 2768 [2022-03-15 22:21:20,555 INFO L226 Difference]: Without dead ends: 2750 [2022-03-15 22:21:20,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=868, Invalid=7688, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 22:21:20,557 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 207 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:20,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 28 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:21:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2022-03-15 22:21:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 1578. [2022-03-15 22:21:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 3.1521876981610655) internal successors, (4971), 1577 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4971 transitions. [2022-03-15 22:21:20,581 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 4971 transitions. Word has length 25 [2022-03-15 22:21:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:20,581 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 4971 transitions. [2022-03-15 22:21:20,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 4971 transitions. [2022-03-15 22:21:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:21:20,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:20,583 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:20,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:20,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:20,800 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2073453110, now seen corresponding path program 26 times [2022-03-15 22:21:20,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:20,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283779239] [2022-03-15 22:21:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:21,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:21,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283779239] [2022-03-15 22:21:21,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283779239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:21,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235050416] [2022-03-15 22:21:21,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:21,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:21,239 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:21,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 22:21:21,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:21,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:21,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:21:21,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:21,630 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:21:21,631 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 33 treesize of output 17 [2022-03-15 22:21:21,783 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:21:21,783 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 24 treesize of output 12 [2022-03-15 22:21:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:21,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:22,322 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:22,322 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 70 treesize of output 88 [2022-03-15 22:21:22,800 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:22,801 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 57 treesize of output 75 [2022-03-15 22:21:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:22,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235050416] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:22,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:22,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:21:22,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462672275] [2022-03-15 22:21:22,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:22,945 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:22,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 173 transitions. [2022-03-15 22:21:22,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:28,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [114582#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 114588#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 114576#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 114587#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)))), 114590#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 114589#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 114578#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x)) (or (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y)))), 114592#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 114591#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 114581#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 114585#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 114580#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 114579#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 114583#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 114577#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 114584#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 114586#(and (<= N (+ 2 z)) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front))] [2022-03-15 22:21:28,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:21:28,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:21:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2938, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:21:28,060 INFO L87 Difference]: Start difference. First operand 1578 states and 4971 transitions. Second operand has 34 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:33,493 INFO L93 Difference]: Finished difference Result 2801 states and 8047 transitions. [2022-03-15 22:21:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:21:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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 25 [2022-03-15 22:21:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:33,498 INFO L225 Difference]: With dead ends: 2801 [2022-03-15 22:21:33,498 INFO L226 Difference]: Without dead ends: 2791 [2022-03-15 22:21:33,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=851, Invalid=8269, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 22:21:33,499 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 240 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:33,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 32 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:21:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-03-15 22:21:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 1592. [2022-03-15 22:21:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 3.145820238843495) internal successors, (5005), 1591 states have internal predecessors, (5005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 5005 transitions. [2022-03-15 22:21:33,526 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 5005 transitions. Word has length 25 [2022-03-15 22:21:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:33,526 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 5005 transitions. [2022-03-15 22:21:33,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 5005 transitions. [2022-03-15 22:21:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:21:33,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:33,528 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:33,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:33,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:33,744 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2139847756, now seen corresponding path program 27 times [2022-03-15 22:21:33,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:33,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588898614] [2022-03-15 22:21:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:34,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:34,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588898614] [2022-03-15 22:21:34,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588898614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:34,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573829751] [2022-03-15 22:21:34,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:34,272 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:34,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 22:21:34,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:21:34,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:34,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 22:21:34,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:34,719 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:21:34,719 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 27 treesize of output 15 [2022-03-15 22:21:34,963 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:21:34,964 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 26 treesize of output 14 [2022-03-15 22:21:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:35,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:35,456 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:35,456 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 70 treesize of output 88 [2022-03-15 22:21:36,085 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:36,085 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 57 treesize of output 75 [2022-03-15 22:21:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:36,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573829751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:36,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:36,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:21:36,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [954354835] [2022-03-15 22:21:36,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:36,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:36,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 175 transitions. [2022-03-15 22:21:36,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:41,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [120850#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 120843#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 120856#(and (<= N (+ 2 z)) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 120854#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 120840#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1))))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (< q2_front q2_back)))), 120848#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 120846#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 120849#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 120845#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 120847#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)))), 120844#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 120853#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 120841#(and (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))), 120842#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 120852#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 120851#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 120855#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1))))] [2022-03-15 22:21:41,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:21:41,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:21:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2942, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:21:41,277 INFO L87 Difference]: Start difference. First operand 1592 states and 5005 transitions. Second operand has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:46,784 INFO L93 Difference]: Finished difference Result 2796 states and 8045 transitions. [2022-03-15 22:21:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:21:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 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 25 [2022-03-15 22:21:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:46,789 INFO L225 Difference]: With dead ends: 2796 [2022-03-15 22:21:46,789 INFO L226 Difference]: Without dead ends: 2780 [2022-03-15 22:21:46,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=774, Invalid=8156, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 22:21:46,790 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 234 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:46,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 32 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2664 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:21:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2022-03-15 22:21:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 1588. [2022-03-15 22:21:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 3.1474480151228734) internal successors, (4995), 1587 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 4995 transitions. [2022-03-15 22:21:46,815 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 4995 transitions. Word has length 25 [2022-03-15 22:21:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:46,815 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 4995 transitions. [2022-03-15 22:21:46,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 4995 transitions. [2022-03-15 22:21:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:21:46,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:46,818 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:46,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:47,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:47,033 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -96885514, now seen corresponding path program 28 times [2022-03-15 22:21:47,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:47,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454732929] [2022-03-15 22:21:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:47,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:47,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454732929] [2022-03-15 22:21:47,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454732929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:47,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667041850] [2022-03-15 22:21:47,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:47,571 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:47,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 22:21:47,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:47,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:47,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 22:21:47,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:47,895 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:21:47,895 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 33 treesize of output 17 [2022-03-15 22:21:48,056 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:21:48,056 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 12 [2022-03-15 22:21:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:48,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:48,503 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:48,503 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 72 treesize of output 90 [2022-03-15 22:21:48,971 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:48,971 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 59 treesize of output 77 [2022-03-15 22:21:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:49,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667041850] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:49,130 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:49,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-03-15 22:21:49,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190347870] [2022-03-15 22:21:49,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:49,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:49,148 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 193 transitions. [2022-03-15 22:21:49,148 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:57,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [127099#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 127105#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 127102#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)))), 127092#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 127101#(and (<= N (+ 2 z)) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 127090#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 127095#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= x y) (<= (+ (* 3 C) z) x) (< y (+ x 1)) (= z 0)), 127106#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 127091#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 127093#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 127100#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (<= N (+ 2 z)) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 127104#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)))), 127096#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 127098#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 127107#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1))), 127103#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 127097#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 127094#(and (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))))] [2022-03-15 22:21:57,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:21:57,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:21:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3154, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:21:57,422 INFO L87 Difference]: Start difference. First operand 1588 states and 4995 transitions. Second operand has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:03,814 INFO L93 Difference]: Finished difference Result 2684 states and 7815 transitions. [2022-03-15 22:22:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:22:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 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 25 [2022-03-15 22:22:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:03,819 INFO L225 Difference]: With dead ends: 2684 [2022-03-15 22:22:03,819 INFO L226 Difference]: Without dead ends: 2680 [2022-03-15 22:22:03,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=792, Invalid=8328, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 22:22:03,821 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 206 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:03,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 34 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:22:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-03-15 22:22:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 1599. [2022-03-15 22:22:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1598 states have (on average 3.15081351689612) internal successors, (5035), 1598 states have internal predecessors, (5035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 5035 transitions. [2022-03-15 22:22:03,847 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 5035 transitions. Word has length 25 [2022-03-15 22:22:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:03,848 INFO L470 AbstractCegarLoop]: Abstraction has 1599 states and 5035 transitions. [2022-03-15 22:22:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 5035 transitions. [2022-03-15 22:22:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:22:03,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:03,850 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:03,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:04,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 22:22:04,063 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1876249970, now seen corresponding path program 29 times [2022-03-15 22:22:04,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:04,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815640279] [2022-03-15 22:22:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:04,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:04,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815640279] [2022-03-15 22:22:04,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815640279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:04,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145526652] [2022-03-15 22:22:04,574 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:04,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:04,575 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:04,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 22:22:04,611 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:22:04,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:04,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:22:04,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:05,086 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:22:05,086 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 17 [2022-03-15 22:22:05,193 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:22:05,194 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 12 [2022-03-15 22:22:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:05,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:05,746 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:22:05,746 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 70 treesize of output 88 [2022-03-15 22:22:06,329 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:22:06,330 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 57 treesize of output 75 [2022-03-15 22:22:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:06,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145526652] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:06,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:06,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:22:06,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823635482] [2022-03-15 22:22:06,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:06,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:06,537 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 149 transitions. [2022-03-15 22:22:06,537 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:12,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [133266#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 133255#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 133254#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) t) z) 0) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 133256#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 133262#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 133257#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 133250#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= q2_back q2_front)) (or (<= (+ t (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N))), 133267#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 133248#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 133264#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 133265#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 133263#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 133258#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 133253#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 133251#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= z x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x z) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ t (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ t (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 133261#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 133249#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 133259#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 133252#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 133260#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)))] [2022-03-15 22:22:12,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:22:12,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:22:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3287, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:22:12,796 INFO L87 Difference]: Start difference. First operand 1599 states and 5035 transitions. Second operand has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:34,658 INFO L93 Difference]: Finished difference Result 3140 states and 8857 transitions. [2022-03-15 22:22:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:22:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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 25 [2022-03-15 22:22:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:34,663 INFO L225 Difference]: With dead ends: 3140 [2022-03-15 22:22:34,663 INFO L226 Difference]: Without dead ends: 3100 [2022-03-15 22:22:34,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5245 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1862, Invalid=19018, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 22:22:34,665 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 308 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 3400 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 3400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:34,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 24 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 3400 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:22:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-03-15 22:22:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 1619. [2022-03-15 22:22:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1618 states have (on average 3.137824474660074) internal successors, (5077), 1618 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 5077 transitions. [2022-03-15 22:22:34,695 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 5077 transitions. Word has length 25 [2022-03-15 22:22:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:34,695 INFO L470 AbstractCegarLoop]: Abstraction has 1619 states and 5077 transitions. [2022-03-15 22:22:34,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 5077 transitions. [2022-03-15 22:22:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:22:34,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:34,698 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:34,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 22:22:34,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:34,911 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1809855324, now seen corresponding path program 30 times [2022-03-15 22:22:34,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:34,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905954752] [2022-03-15 22:22:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:35,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:35,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905954752] [2022-03-15 22:22:35,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905954752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:35,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953376536] [2022-03-15 22:22:35,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:35,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:35,476 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:35,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 22:22:35,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:22:35,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:35,527 WARN L261 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 22:22:35,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:36,043 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:22:36,044 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 17 [2022-03-15 22:22:36,271 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:22:36,271 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 26 treesize of output 14 [2022-03-15 22:22:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:36,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:36,776 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:22:36,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 70 treesize of output 88 [2022-03-15 22:22:37,434 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:22:37,435 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 69 treesize of output 81 [2022-03-15 22:22:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:37,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953376536] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:37,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:37,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 40 [2022-03-15 22:22:37,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955858588] [2022-03-15 22:22:37,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:37,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:37,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 151 transitions. [2022-03-15 22:22:37,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:45,739 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [140008#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) t) z) 0) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 140009#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 140021#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 140015#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 140003#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 140012#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 140002#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 140005#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 140020#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 140006#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 140019#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 140014#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 140017#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 140016#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 140007#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= z x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x z) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ t (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ t (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 140010#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 140018#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 140011#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 140004#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= q2_back q2_front)) (or (<= (+ t (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N))), 140013#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 22:22:45,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:22:45,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:22:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3515, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:22:45,740 INFO L87 Difference]: Start difference. First operand 1619 states and 5077 transitions. Second operand has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:08,538 INFO L93 Difference]: Finished difference Result 3167 states and 8913 transitions. [2022-03-15 22:23:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 22:23:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 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 25 [2022-03-15 22:23:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:08,543 INFO L225 Difference]: With dead ends: 3167 [2022-03-15 22:23:08,543 INFO L226 Difference]: Without dead ends: 3083 [2022-03-15 22:23:08,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5915 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=2090, Invalid=20560, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 22:23:08,545 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 337 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:08,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 25 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:23:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2022-03-15 22:23:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 1611. [2022-03-15 22:23:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 3.142857142857143) internal successors, (5060), 1610 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5060 transitions. [2022-03-15 22:23:08,605 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5060 transitions. Word has length 25 [2022-03-15 22:23:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:08,605 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 5060 transitions. [2022-03-15 22:23:08,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5060 transitions. [2022-03-15 22:23:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:23:08,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:08,608 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:08,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:08,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:08,824 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash 401692856, now seen corresponding path program 31 times [2022-03-15 22:23:08,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:08,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310659179] [2022-03-15 22:23:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:09,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:09,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310659179] [2022-03-15 22:23:09,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310659179] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:09,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082301103] [2022-03-15 22:23:09,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:09,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:09,336 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:09,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 22:23:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:09,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:23:09,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:09,664 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:23:09,665 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 33 treesize of output 17 [2022-03-15 22:23:09,773 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:23:09,774 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 24 treesize of output 12 [2022-03-15 22:23:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:09,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:10,178 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:23:10,178 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 70 treesize of output 88 [2022-03-15 22:23:10,605 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:23:10,606 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 57 treesize of output 75 [2022-03-15 22:23:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:10,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082301103] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:10,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:10,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:23:10,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621464957] [2022-03-15 22:23:10,718 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:10,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:10,734 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 159 transitions. [2022-03-15 22:23:10,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:18,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [146785#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 146782#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 146790#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 146789#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 146773#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 146776#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 146777#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 146778#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 146792#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 146791#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 146788#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 146781#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 146786#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 146787#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 146774#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 146780#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) t) z) 0) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 146775#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x)) (or (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y)))), 146783#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 146779#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 146784#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 22:23:18,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:23:18,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:23:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3286, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:23:18,775 INFO L87 Difference]: Start difference. First operand 1611 states and 5060 transitions. Second operand has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:42,872 INFO L93 Difference]: Finished difference Result 3511 states and 9816 transitions. [2022-03-15 22:23:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:23:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 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 25 [2022-03-15 22:23:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:42,878 INFO L225 Difference]: With dead ends: 3511 [2022-03-15 22:23:42,878 INFO L226 Difference]: Without dead ends: 3471 [2022-03-15 22:23:42,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5513 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1871, Invalid=20181, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 22:23:42,879 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 332 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:42,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 29 Invalid, 4277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:23:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2022-03-15 22:23:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1625. [2022-03-15 22:23:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 3.1342364532019706) internal successors, (5090), 1624 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 5090 transitions. [2022-03-15 22:23:42,934 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 5090 transitions. Word has length 25 [2022-03-15 22:23:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:42,934 INFO L470 AbstractCegarLoop]: Abstraction has 1625 states and 5090 transitions. [2022-03-15 22:23:42,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 5090 transitions. [2022-03-15 22:23:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:23:42,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:42,937 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:42,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:43,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:23:43,140 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 468087502, now seen corresponding path program 32 times [2022-03-15 22:23:43,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:43,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248618294] [2022-03-15 22:23:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:43,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:43,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248618294] [2022-03-15 22:23:43,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248618294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:43,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152492195] [2022-03-15 22:23:43,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:43,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:43,656 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:43,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 22:23:43,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:43,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:43,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 22:23:43,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:44,145 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:23:44,145 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 27 treesize of output 15 [2022-03-15 22:23:44,384 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:23:44,385 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 26 treesize of output 14 [2022-03-15 22:23:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:44,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:44,908 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:23:44,908 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 70 treesize of output 88 [2022-03-15 22:23:45,448 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:23:45,448 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 57 treesize of output 75 [2022-03-15 22:23:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:45,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152492195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:45,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:45,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:23:45,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278982177] [2022-03-15 22:23:45,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:45,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:45,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 161 transitions. [2022-03-15 22:23:45,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:54,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [153935#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 153918#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 153934#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 153925#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) t) z) 0) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 153927#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 153916#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1))))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (< q2_front q2_back)))), 153924#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 153917#(and (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))), 153933#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 153928#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 153920#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 153930#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 153922#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 153931#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 153919#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 153929#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 153926#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 153932#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 153921#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 153923#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1))))] [2022-03-15 22:23:54,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:23:54,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:23:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3289, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:23:54,728 INFO L87 Difference]: Start difference. First operand 1625 states and 5090 transitions. Second operand has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:17,852 INFO L93 Difference]: Finished difference Result 3488 states and 9746 transitions. [2022-03-15 22:24:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 22:24:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 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 25 [2022-03-15 22:24:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:17,858 INFO L225 Difference]: With dead ends: 3488 [2022-03-15 22:24:17,858 INFO L226 Difference]: Without dead ends: 3416 [2022-03-15 22:24:17,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5302 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=1748, Invalid=19714, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 22:24:17,859 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 312 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:17,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 29 Invalid, 4282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 4114 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:24:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2022-03-15 22:24:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 1621. [2022-03-15 22:24:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 3.1358024691358026) internal successors, (5080), 1620 states have internal predecessors, (5080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 5080 transitions. [2022-03-15 22:24:17,887 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 5080 transitions. Word has length 25 [2022-03-15 22:24:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:17,887 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 5080 transitions. [2022-03-15 22:24:17,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 5080 transitions. [2022-03-15 22:24:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:24:17,890 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:17,890 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:17,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:18,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 22:24:18,104 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1768645768, now seen corresponding path program 33 times [2022-03-15 22:24:18,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:18,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622943332] [2022-03-15 22:24:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:18,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:18,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622943332] [2022-03-15 22:24:18,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622943332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:18,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738880019] [2022-03-15 22:24:18,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:24:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:18,571 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:18,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 22:24:18,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:24:18,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 22:24:18,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:19,016 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:24:19,016 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 17 [2022-03-15 22:24:19,251 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:24:19,251 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 24 treesize of output 12 [2022-03-15 22:24:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:19,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:19,862 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:24:19,862 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 77 treesize of output 93 [2022-03-15 22:24:20,806 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:24:20,806 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 142 treesize of output 144 [2022-03-15 22:24:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:21,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738880019] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:21,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:21,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2022-03-15 22:24:21,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306965265] [2022-03-15 22:24:21,028 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:21,030 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:21,048 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 179 transitions. [2022-03-15 22:24:21,048 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:28,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [161034#(and (<= N (+ 2 z)) (= j (select q1 q1_front)) (<= (+ 2 z) N) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) y) x) (<= (+ (* 3 C) z) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0) (= q2_back q2_front)), 161030#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= x y) (<= (+ (* 3 C) z) x) (< y (+ x 1)) (= z 0)), 161043#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 161042#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 161041#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 161027#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 161046#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 161036#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) t) z) 0) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= y x) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= x y) (not (= (select q1 (+ q1_back 1)) 0)))), 161028#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 161031#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 161035#(and (or (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= x (+ C y))) (or (<= (+ C y) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 161044#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 161032#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 161037#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 161033#(and (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= N (+ (select q2 q2_front) z (select q1 q1_front))) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 161026#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 161045#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 161038#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 161029#(and (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 161039#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 161040#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)))] [2022-03-15 22:24:28,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:24:28,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:24:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3630, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 22:24:28,376 INFO L87 Difference]: Start difference. First operand 1621 states and 5080 transitions. Second operand has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:51,199 INFO L93 Difference]: Finished difference Result 3366 states and 9476 transitions. [2022-03-15 22:24:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 22:24:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 22:24:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:51,205 INFO L225 Difference]: With dead ends: 3366 [2022-03-15 22:24:51,205 INFO L226 Difference]: Without dead ends: 3360 [2022-03-15 22:24:51,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4677 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=1668, Invalid=18354, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 22:24:51,206 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 249 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 4162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:51,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 31 Invalid, 4323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 4162 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:24:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-03-15 22:24:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 1596. [2022-03-15 22:24:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 3.153605015673981) internal successors, (5030), 1595 states have internal predecessors, (5030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 5030 transitions. [2022-03-15 22:24:51,236 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 5030 transitions. Word has length 25 [2022-03-15 22:24:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:51,236 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 5030 transitions. [2022-03-15 22:24:51,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 5030 transitions. [2022-03-15 22:24:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:24:51,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:51,239 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:51,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:51,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 22:24:51,461 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1271461176, now seen corresponding path program 34 times [2022-03-15 22:24:51,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:51,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061783250] [2022-03-15 22:24:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:51,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:51,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061783250] [2022-03-15 22:24:51,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061783250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:51,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516405168] [2022-03-15 22:24:51,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:24:51,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:51,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:51,927 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:51,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 22:24:51,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:24:51,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:51,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 22:24:51,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:52,371 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:24:52,372 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 17 [2022-03-15 22:24:52,511 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:24:52,511 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 26 treesize of output 14 [2022-03-15 22:24:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:52,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:53,040 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:24:53,040 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 70 treesize of output 88 [2022-03-15 22:24:53,500 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:24:53,500 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 57 treesize of output 75 [2022-03-15 22:24:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:53,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516405168] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:53,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:53,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:24:53,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511701369] [2022-03-15 22:24:53,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:53,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:53,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 22:24:53,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:59,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [167959#(and (or (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y)))), 167964#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 167966#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 167953#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 167965#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 167951#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ t (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x))), 167956#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 167962#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 167958#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 167961#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 167957#(and (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j t))) (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 167948#(and (or (<= z x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N t) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= t N)) (or (<= x z) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 167963#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 167947#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 167949#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 167955#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 167954#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 167952#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 167950#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 167960#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)))] [2022-03-15 22:24:59,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:24:59,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:24:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3256, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:24:59,521 INFO L87 Difference]: Start difference. First operand 1596 states and 5030 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:12,190 INFO L93 Difference]: Finished difference Result 2100 states and 6307 transitions. [2022-03-15 22:25:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 22:25:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 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 25 [2022-03-15 22:25:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:12,194 INFO L225 Difference]: With dead ends: 2100 [2022-03-15 22:25:12,194 INFO L226 Difference]: Without dead ends: 2080 [2022-03-15 22:25:12,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1597, Invalid=13903, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:25:12,195 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 346 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:12,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 13 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:25:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-03-15 22:25:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1608. [2022-03-15 22:25:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 3.145612943372744) internal successors, (5055), 1607 states have internal predecessors, (5055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 5055 transitions. [2022-03-15 22:25:12,216 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 5055 transitions. Word has length 25 [2022-03-15 22:25:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:12,216 INFO L470 AbstractCegarLoop]: Abstraction has 1608 states and 5055 transitions. [2022-03-15 22:25:12,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 5055 transitions. [2022-03-15 22:25:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:25:12,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:12,218 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:12,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:12,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 22:25:12,435 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1205066530, now seen corresponding path program 35 times [2022-03-15 22:25:12,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:12,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289622070] [2022-03-15 22:25:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:12,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:12,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289622070] [2022-03-15 22:25:12,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289622070] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:12,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209375931] [2022-03-15 22:25:12,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:25:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:12,892 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:12,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 22:25:12,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:25:12,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 22:25:12,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:13,262 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:25:13,263 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 17 [2022-03-15 22:25:13,494 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:25:13,494 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 26 treesize of output 14 [2022-03-15 22:25:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:13,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:14,075 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:14,075 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 70 treesize of output 88 [2022-03-15 22:25:14,620 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:14,620 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 57 treesize of output 75 [2022-03-15 22:25:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:14,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209375931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:14,778 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:14,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:25:14,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [537319873] [2022-03-15 22:25:14,779 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:14,781 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:14,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 22:25:14,793 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:20,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [173602#(and (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j t))) (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 173599#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 173614#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 173598#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 173604#(and (or (not (< q2_front q2_back)) (<= x (+ z (* 2 C)))) (or (<= (+ z (* 2 C)) x) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= i (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y)))), 173612#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 173608#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 173605#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 173606#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 173597#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x z)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= z x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ t (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x))), 173607#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 173615#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 173600#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 173601#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 173611#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 173613#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 173603#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (<= (+ y (* 2 C)) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (= (+ q2_front 1) q2_back) (not (< q2_front q2_back))) (or (<= x (+ y (* 2 C))) (not (< q2_front q2_back)))), 173609#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 173610#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 22:25:20,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:25:20,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:25:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3134, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:25:20,306 INFO L87 Difference]: Start difference. First operand 1608 states and 5055 transitions. Second operand has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:33,515 INFO L93 Difference]: Finished difference Result 2189 states and 6516 transitions. [2022-03-15 22:25:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 22:25:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 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 25 [2022-03-15 22:25:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:33,519 INFO L225 Difference]: With dead ends: 2189 [2022-03-15 22:25:33,519 INFO L226 Difference]: Without dead ends: 2151 [2022-03-15 22:25:33,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1758, Invalid=14498, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 22:25:33,520 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 316 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:33,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 14 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:25:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2022-03-15 22:25:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1602. [2022-03-15 22:25:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 3.1492816989381636) internal successors, (5042), 1601 states have internal predecessors, (5042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 5042 transitions. [2022-03-15 22:25:33,540 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 5042 transitions. Word has length 25 [2022-03-15 22:25:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:33,540 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 5042 transitions. [2022-03-15 22:25:33,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 5042 transitions. [2022-03-15 22:25:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:25:33,542 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:33,543 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:33,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:33,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:33,748 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1272962104, now seen corresponding path program 36 times [2022-03-15 22:25:33,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:33,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954117725] [2022-03-15 22:25:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:34,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:34,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954117725] [2022-03-15 22:25:34,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954117725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:34,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111261357] [2022-03-15 22:25:34,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:25:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:34,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:34,150 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:34,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 22:25:34,196 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:25:34,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:34,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 22:25:34,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:34,475 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:25:34,475 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 27 treesize of output 15 [2022-03-15 22:25:34,655 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:25:34,656 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 26 treesize of output 14 [2022-03-15 22:25:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:34,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:35,273 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:35,273 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 70 treesize of output 88 [2022-03-15 22:25:35,680 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:35,680 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 57 treesize of output 75 [2022-03-15 22:25:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:35,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111261357] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:35,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:35,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:25:35,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832583968] [2022-03-15 22:25:35,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:35,796 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:35,810 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 153 transitions. [2022-03-15 22:25:35,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:42,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [179340#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 179332#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 179351#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 179335#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 179347#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 179352#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 179341#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 179348#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 179336#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x)) (or (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y)))), 179345#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 179344#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 179331#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 179337#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 179334#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 179346#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 179338#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 179349#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 179343#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 179350#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 179339#(and (or (<= z x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N t) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= t N)) (or (<= x z) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 179333#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 179342#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 22:25:42,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:25:42,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:25:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3531, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:25:42,345 INFO L87 Difference]: Start difference. First operand 1602 states and 5042 transitions. Second operand has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:56,014 INFO L93 Difference]: Finished difference Result 2169 states and 6492 transitions. [2022-03-15 22:25:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 22:25:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 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 25 [2022-03-15 22:25:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:56,018 INFO L225 Difference]: With dead ends: 2169 [2022-03-15 22:25:56,018 INFO L226 Difference]: Without dead ends: 2149 [2022-03-15 22:25:56,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1401, Invalid=15111, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 22:25:56,019 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 327 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:56,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 21 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3223 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:25:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2022-03-15 22:25:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1613. [2022-03-15 22:25:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 3.142059553349876) internal successors, (5065), 1612 states have internal predecessors, (5065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5065 transitions. [2022-03-15 22:25:56,044 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5065 transitions. Word has length 25 [2022-03-15 22:25:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:56,044 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 5065 transitions. [2022-03-15 22:25:56,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5065 transitions. [2022-03-15 22:25:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:25:56,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:56,047 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:56,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 22:25:56,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 22:25:56,248 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1339356750, now seen corresponding path program 37 times [2022-03-15 22:25:56,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:56,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284791343] [2022-03-15 22:25:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:56,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:56,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284791343] [2022-03-15 22:25:56,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284791343] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:56,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725669112] [2022-03-15 22:25:56,734 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:25:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:56,735 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:56,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 22:25:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:56,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 22:25:56,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:57,049 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:25:57,049 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 17 [2022-03-15 22:25:57,287 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:25:57,287 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 30 treesize of output 14 [2022-03-15 22:25:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:57,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:57,781 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:57,782 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 70 treesize of output 88 [2022-03-15 22:25:58,220 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:25:58,221 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 57 treesize of output 75 [2022-03-15 22:25:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:58,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725669112] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:58,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:58,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-03-15 22:25:58,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259422033] [2022-03-15 22:25:58,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:58,362 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:58,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 153 transitions. [2022-03-15 22:25:58,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:04,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [185072#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 185079#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 185071#(and (or (<= (+ C y) x) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= x (+ C y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))), 185077#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 185084#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 185074#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ C z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ C z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 185066#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1))))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (< q2_front q2_back)))), 185070#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 185080#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 185068#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 185067#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 185069#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 185078#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 185076#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 185085#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 185086#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 185073#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 185081#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 185075#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 185083#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 185082#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0)))] [2022-03-15 22:26:04,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:26:04,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:04,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:26:04,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3420, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:26:04,397 INFO L87 Difference]: Start difference. First operand 1613 states and 5065 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:26:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:14,817 INFO L93 Difference]: Finished difference Result 2153 states and 6452 transitions. [2022-03-15 22:26:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 22:26:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 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 25 [2022-03-15 22:26:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:14,820 INFO L225 Difference]: With dead ends: 2153 [2022-03-15 22:26:14,820 INFO L226 Difference]: Without dead ends: 2119 [2022-03-15 22:26:14,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3682 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1303, Invalid=14953, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 22:26:14,821 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 307 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:14,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 21 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:26:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-03-15 22:26:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1609. [2022-03-15 22:26:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 3.1430348258706466) internal successors, (5054), 1608 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have 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:26:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 5054 transitions. [2022-03-15 22:26:14,842 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 5054 transitions. Word has length 25 [2022-03-15 22:26:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:14,842 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 5054 transitions. [2022-03-15 22:26:14,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:26:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 5054 transitions. [2022-03-15 22:26:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:26:14,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:14,845 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:14,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:15,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 22:26:15,059 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -897376520, now seen corresponding path program 38 times [2022-03-15 22:26:15,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:15,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707972659] [2022-03-15 22:26:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:15,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:15,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707972659] [2022-03-15 22:26:15,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707972659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:15,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888018692] [2022-03-15 22:26:15,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:26:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:15,568 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 22:26:15,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:26:15,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:15,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 22:26:15,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:15,900 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:26:15,901 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 15 [2022-03-15 22:26:16,098 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:26:16,098 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 26 treesize of output 14 [2022-03-15 22:26:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:16,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:16,556 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:26:16,556 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 72 treesize of output 90 [2022-03-15 22:26:16,913 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:26:16,914 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 59 treesize of output 77 [2022-03-15 22:26:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:17,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888018692] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:17,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:17,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-03-15 22:26:17,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855922569] [2022-03-15 22:26:17,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:17,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:17,057 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 169 transitions. [2022-03-15 22:26:17,057 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:23,646 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [190792#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 190780#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 190783#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 190787#(and (<= N (+ (select q2 q2_front) j z)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (<= x (+ (* 3 C) z)) (<= (+ q2_front 1) q2_back) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x) (= z 0)), 190794#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q1_back q1_front) (= z 0))), 190797#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front))), 190782#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 190777#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (= (+ (* (- 1) t) z) 0)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) z (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= y x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 190785#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= x y) (<= (+ (* 3 C) z) x) (< y (+ x 1)) (= z 0)), 190791#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= (+ (select q2 q2_front) z (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y)) (<= i (+ (select q2 q2_front) z (select q1 q1_front)))), 190781#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 190793#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z 0))), 190778#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j 1)) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= j (select q1 q1_front))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t))), 190779#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 2 z) N) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C z) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (<= N i) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (<= x (+ C y))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ C y) x) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) 1)) (<= N i) (= z t) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) 1)) (<= N i) (not (< q1_front q1_back)) (= q2_back q2_front))), 190789#(and (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 190795#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i z) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= z 0)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< q1_front (+ q1_back 1))))), 190788#(and (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x y) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= y x) (not (= (select q1 q1_back) 0)) (< i N))), 190784#(and (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 190790#(and (<= (+ C y) x) (<= (+ z (* 2 C)) x) (<= i (+ (select q2 q2_front) j z)) (<= (+ q2_front 1) q2_back) (<= x (+ z (* 2 C))) (<= (+ (select q2 q2_front) j z) N) (<= q2_back (+ q2_front 1)) (= z 0) (<= x (+ C y))), 190786#(and (<= (+ (select q2 q2_front) z (select q2 (+ q2_front 1))) N) (<= (+ C y) x) (<= N (+ (select q2 q2_front) z (select q2 (+ q2_front 1)))) (<= x (+ (* 3 C) z)) (<= (+ (* 3 C) z) x) (= z 0) (<= x (+ C y))), 190796#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (<= N 1)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 2 z) N) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x y) (<= N 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= N 1) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)))] [2022-03-15 22:26:23,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:26:23,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:26:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3520, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:26:23,647 INFO L87 Difference]: Start difference. First operand 1609 states and 5054 transitions. Second operand has 38 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:38,366 INFO L93 Difference]: Finished difference Result 2064 states and 6239 transitions. [2022-03-15 22:26:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 22:26:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 22:26:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:38,369 INFO L225 Difference]: With dead ends: 2064 [2022-03-15 22:26:38,369 INFO L226 Difference]: Without dead ends: 2058 [2022-03-15 22:26:38,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1440, Invalid=14816, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 22:26:38,370 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 275 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:38,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 22 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:26:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-03-15 22:26:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1594. [2022-03-15 22:26:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 3.1537978656622725) internal successors, (5024), 1593 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have 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:26:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 5024 transitions. [2022-03-15 22:26:38,407 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 5024 transitions. Word has length 25 [2022-03-15 22:26:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:38,407 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 5024 transitions. [2022-03-15 22:26:38,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 5024 transitions. [2022-03-15 22:26:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:26:38,419 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:38,419 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:38,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:38,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 22:26:38,619 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -92408708, now seen corresponding path program 39 times [2022-03-15 22:26:38,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:38,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485227493] [2022-03-15 22:26:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:38,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:38,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485227493] [2022-03-15 22:26:38,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485227493] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:38,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563229379] [2022-03-15 22:26:38,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:26:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:38,675 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:38,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 22:26:38,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:26:38,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:38,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:26:38,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:38,764 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 11 treesize of output 7 [2022-03-15 22:26:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:38,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:38,804 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:26:38,804 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 14 [2022-03-15 22:26:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:38,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563229379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:38,816 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:38,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 22:26:38,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834352527] [2022-03-15 22:26:38,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:38,818 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:38,835 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 164 transitions. [2022-03-15 22:26:38,835 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:39,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [196355#(or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 196359#(or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 (+ q1_front 1)) 0))), 196353#(or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 196356#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (<= (+ q1_back 2) q1_front)), 196354#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (<= (+ q1_back 2) q1_front)), 196352#(or (<= q1_back q1_front) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 196357#(or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 196358#(or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 196351#(or (not f) (not (< q1_front q1_back)) (= (select q1 q1_front) (select q1 (+ q1_front 2))))] [2022-03-15 22:26:39,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:26:39,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:26:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:26:39,425 INFO L87 Difference]: Start difference. First operand 1594 states and 5024 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:39,943 INFO L93 Difference]: Finished difference Result 2481 states and 7447 transitions. [2022-03-15 22:26:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:26:39,943 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 22:26:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:39,947 INFO L225 Difference]: With dead ends: 2481 [2022-03-15 22:26:39,947 INFO L226 Difference]: Without dead ends: 2478 [2022-03-15 22:26:39,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=427, Invalid=2329, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:26:39,951 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 243 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:39,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 22 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2022-03-15 22:26:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 1725. [2022-03-15 22:26:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 3.1421113689095126) internal successors, (5417), 1724 states have internal predecessors, (5417), 0 states have call successors, (0), 0 states have 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:26:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 5417 transitions. [2022-03-15 22:26:39,978 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 5417 transitions. Word has length 26 [2022-03-15 22:26:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:39,978 INFO L470 AbstractCegarLoop]: Abstraction has 1725 states and 5417 transitions. [2022-03-15 22:26:39,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 5417 transitions. [2022-03-15 22:26:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:26:39,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:39,981 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:39,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:40,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:40,198 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1160612082, now seen corresponding path program 40 times [2022-03-15 22:26:40,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:40,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655819989] [2022-03-15 22:26:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:40,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:40,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655819989] [2022-03-15 22:26:40,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655819989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:40,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065567609] [2022-03-15 22:26:40,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:26:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:40,283 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:40,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 22:26:40,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:26:40,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:40,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:26:40,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:40,378 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 11 treesize of output 7 [2022-03-15 22:26:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:26:40,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:40,434 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:26:40,434 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 14 [2022-03-15 22:26:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:26:40,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065567609] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:40,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:40,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-03-15 22:26:40,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674260273] [2022-03-15 22:26:40,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:40,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:40,468 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 164 transitions. [2022-03-15 22:26:40,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:40,692 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 22:26:41,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [202513#(or (not (= (select q1 q1_back) 1)) (<= q1_back q1_front) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 202510#(or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) j)), 202511#(or (not (= (select q1 q1_back) 1)) (not f) (not (< q1_front q1_back)) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 202514#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 202512#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 1) q1_front) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 202515#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (<= (+ q1_back 2) q1_front)), 202516#(or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (<= (+ q1_back 2) q1_front)), 202508#(or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 (+ q1_front 1)) 0))), 202509#(or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (= (select q1 (+ q1_front 1)) 0)))] [2022-03-15 22:26:41,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:26:41,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:26:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:26:41,119 INFO L87 Difference]: Start difference. First operand 1725 states and 5417 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:41,988 INFO L93 Difference]: Finished difference Result 5272 states and 16333 transitions. [2022-03-15 22:26:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:26:42,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 22:26:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:42,016 INFO L225 Difference]: With dead ends: 5272 [2022-03-15 22:26:42,016 INFO L226 Difference]: Without dead ends: 5246 [2022-03-15 22:26:42,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=700, Invalid=3460, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:26:42,017 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 328 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:42,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 24 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-03-15 22:26:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 2044. [2022-03-15 22:26:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2043 states have (on average 3.28928046989721) internal successors, (6720), 2043 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have 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:26:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 6720 transitions. [2022-03-15 22:26:42,061 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 6720 transitions. Word has length 26 [2022-03-15 22:26:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:42,061 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 6720 transitions. [2022-03-15 22:26:42,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 6720 transitions. [2022-03-15 22:26:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:26:42,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:42,065 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:42,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:42,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:42,275 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash -27303173, now seen corresponding path program 41 times [2022-03-15 22:26:42,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:42,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450790997] [2022-03-15 22:26:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:26:42,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:42,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450790997] [2022-03-15 22:26:42,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450790997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:42,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668634198] [2022-03-15 22:26:42,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:26:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:42,304 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:42,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 22:26:42,358 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:26:42,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:42,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:26:42,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:26:42,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:26:42,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668634198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:42,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:42,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 22:26:42,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966293431] [2022-03-15 22:26:42,403 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:42,405 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:42,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 191 transitions. [2022-03-15 22:26:42,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:42,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:26:42,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:26:42,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:26:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:26:42,691 INFO L87 Difference]: Start difference. First operand 2044 states and 6720 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:26:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:42,736 INFO L93 Difference]: Finished difference Result 3585 states and 11677 transitions. [2022-03-15 22:26:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:26:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 22:26:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:42,742 INFO L225 Difference]: With dead ends: 3585 [2022-03-15 22:26:42,742 INFO L226 Difference]: Without dead ends: 3533 [2022-03-15 22:26:42,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 26 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:26:42,742 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:42,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 2 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:26:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2022-03-15 22:26:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2498. [2022-03-15 22:26:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2497 states have (on average 3.3584301161393673) internal successors, (8386), 2497 states have internal predecessors, (8386), 0 states have call successors, (0), 0 states have 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:26:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 8386 transitions. [2022-03-15 22:26:42,781 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 8386 transitions. Word has length 26 [2022-03-15 22:26:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:42,781 INFO L470 AbstractCegarLoop]: Abstraction has 2498 states and 8386 transitions. [2022-03-15 22:26:42,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:26:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 8386 transitions. [2022-03-15 22:26:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:26:42,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:42,784 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:42,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 22:26:42,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:26:42,999 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -802740103, now seen corresponding path program 42 times [2022-03-15 22:26:43,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:43,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928611595] [2022-03-15 22:26:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:43,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:43,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928611595] [2022-03-15 22:26:43,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928611595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:43,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102657715] [2022-03-15 22:26:43,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:26:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:43,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:43,070 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:43,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 22:26:43,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 22:26:43,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:43,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:26:43,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:43,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:43,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102657715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:43,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:43,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 22:26:43,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284188604] [2022-03-15 22:26:43,152 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:43,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:43,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 187 transitions. [2022-03-15 22:26:43,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:43,449 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 6 treesize of output 4 [2022-03-15 22:26:43,485 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 6 treesize of output 4 [2022-03-15 22:26:43,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:26:43,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:26:43,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:26:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:26:43,534 INFO L87 Difference]: Start difference. First operand 2498 states and 8386 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 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 22:26:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:43,610 INFO L93 Difference]: Finished difference Result 4587 states and 14856 transitions. [2022-03-15 22:26:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:26:43,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 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 27 [2022-03-15 22:26:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:43,619 INFO L225 Difference]: With dead ends: 4587 [2022-03-15 22:26:43,619 INFO L226 Difference]: Without dead ends: 4508 [2022-03-15 22:26:43,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:26:43,619 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:43,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 2 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:26:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2022-03-15 22:26:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 3212. [2022-03-15 22:26:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3211 states have (on average 3.3422609778885084) internal successors, (10732), 3211 states have internal predecessors, (10732), 0 states have call successors, (0), 0 states have 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:26:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 10732 transitions. [2022-03-15 22:26:43,669 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 10732 transitions. Word has length 27 [2022-03-15 22:26:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:43,669 INFO L470 AbstractCegarLoop]: Abstraction has 3212 states and 10732 transitions. [2022-03-15 22:26:43,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 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 22:26:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 10732 transitions. [2022-03-15 22:26:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:43,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:43,674 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:43,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:43,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 22:26:43,887 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -467073815, now seen corresponding path program 43 times [2022-03-15 22:26:43,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:43,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402744760] [2022-03-15 22:26:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:44,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:44,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402744760] [2022-03-15 22:26:44,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402744760] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:44,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793454914] [2022-03-15 22:26:44,058 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:26:44,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:44,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:44,068 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:44,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 22:26:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:44,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:26:44,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:44,177 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 5 treesize of output 3 [2022-03-15 22:26:44,210 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 35 treesize of output 27 [2022-03-15 22:26:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 22:26:44,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:44,290 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:26:44,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-03-15 22:26:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 22:26:44,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793454914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:44,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:44,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 8] total 21 [2022-03-15 22:26:44,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96455999] [2022-03-15 22:26:44,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:44,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:44,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 190 transitions. [2022-03-15 22:26:44,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:45,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [232061#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front))), 232064#(and (or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 (+ q1_front 1)) 0))) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0))) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)))), 232055#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 232057#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2))) (not (< q1_front (+ q1_back 1))))), 232056#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= (select q1 q1_front) (select q1 (+ q1_front 2))))), 232062#(and (or (not (= (select q1 q1_back) 1)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front) (<= (+ q1_back 2) q1_front))), 232052#(and (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0)) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (not (= j 0)))), 232060#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= (select q1 q1_front) (select q1 (+ q1_front 2))))), 232054#(or (not f) (<= q1_back q1_front)), 232053#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (not (= j 0))) (or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0))), 232063#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 q1_front) (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front))), 232051#(and (or (not g) (<= q2_back q2_front) (not (= j 0))) (or (not g) (<= q2_back (+ q2_front 1)))), 232058#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= q2_back q2_front) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2))))), 232059#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= (select q1 q1_front) (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (= q2_back q2_front)))] [2022-03-15 22:26:45,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:26:45,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:26:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:26:45,788 INFO L87 Difference]: Start difference. First operand 3212 states and 10732 transitions. Second operand has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:48,694 INFO L93 Difference]: Finished difference Result 6939 states and 21725 transitions. [2022-03-15 22:26:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:26:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 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 28 [2022-03-15 22:26:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:48,709 INFO L225 Difference]: With dead ends: 6939 [2022-03-15 22:26:48,709 INFO L226 Difference]: Without dead ends: 6939 [2022-03-15 22:26:48,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 94 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4688 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1742, Invalid=13758, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:26:48,711 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 426 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:48,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 29 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:26:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2022-03-15 22:26:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 3385. [2022-03-15 22:26:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 3.3223995271867612) internal successors, (11243), 3384 states have internal predecessors, (11243), 0 states have call successors, (0), 0 states have 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:26:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 11243 transitions. [2022-03-15 22:26:48,797 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 11243 transitions. Word has length 28 [2022-03-15 22:26:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:48,797 INFO L470 AbstractCegarLoop]: Abstraction has 3385 states and 11243 transitions. [2022-03-15 22:26:48,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 11243 transitions. [2022-03-15 22:26:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:48,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:48,803 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:48,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:49,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 22:26:49,018 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1086328449, now seen corresponding path program 44 times [2022-03-15 22:26:49,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:49,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111716999] [2022-03-15 22:26:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 22:26:49,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:49,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111716999] [2022-03-15 22:26:49,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111716999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:49,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563553259] [2022-03-15 22:26:49,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:26:49,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:49,067 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:49,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 22:26:49,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:26:49,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:49,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:26:49,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:49,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 22:26:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:49,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:49,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:26:49,240 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 19 [2022-03-15 22:26:49,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:26:49,370 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 23 treesize of output 27 [2022-03-15 22:26:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:49,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563553259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:49,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:49,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 27 [2022-03-15 22:26:49,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899788367] [2022-03-15 22:26:49,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:49,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:49,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 190 transitions. [2022-03-15 22:26:49,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:50,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [246144#(and (<= q2_back (+ q2_front 2)) (or (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))), 246147#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 246142#(or (not f) (= q2_back q2_front)), 246145#(not f), 246143#(and (or (<= q2_back (+ q2_front 2)) (not g)) (or (not g) (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))), 246146#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))] [2022-03-15 22:26:50,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:26:50,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:26:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:26:50,016 INFO L87 Difference]: Start difference. First operand 3385 states and 11243 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:50,895 INFO L93 Difference]: Finished difference Result 9012 states and 29228 transitions. [2022-03-15 22:26:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:26:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 22:26:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:50,913 INFO L225 Difference]: With dead ends: 9012 [2022-03-15 22:26:50,913 INFO L226 Difference]: Without dead ends: 8966 [2022-03-15 22:26:50,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 78 SyntacticMatches, 24 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=3632, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:26:50,914 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 227 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:50,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 15 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2022-03-15 22:26:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 3991. [2022-03-15 22:26:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3990 states have (on average 3.354887218045113) internal successors, (13386), 3990 states have internal predecessors, (13386), 0 states have call successors, (0), 0 states have 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:26:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 13386 transitions. [2022-03-15 22:26:51,020 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 13386 transitions. Word has length 28 [2022-03-15 22:26:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:51,020 INFO L470 AbstractCegarLoop]: Abstraction has 3991 states and 13386 transitions. [2022-03-15 22:26:51,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 13386 transitions. [2022-03-15 22:26:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:51,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:51,029 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:51,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:51,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:51,239 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1191614377, now seen corresponding path program 45 times [2022-03-15 22:26:51,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:51,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096333181] [2022-03-15 22:26:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:51,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:51,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096333181] [2022-03-15 22:26:51,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096333181] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:51,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183200231] [2022-03-15 22:26:51,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:26:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:51,308 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:51,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 22:26:51,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:26:51,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:51,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:26:51,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:51,462 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 11 treesize of output 7 [2022-03-15 22:26:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:51,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:51,532 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:26:51,533 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 19 [2022-03-15 22:26:51,613 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:26:51,614 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 23 treesize of output 27 [2022-03-15 22:26:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:51,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183200231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:51,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:51,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 30 [2022-03-15 22:26:51,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53419664] [2022-03-15 22:26:51,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:51,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:51,662 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 204 transitions. [2022-03-15 22:26:51,662 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:52,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [263398#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 263399#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 263400#(or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))), 263402#(or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))), 263397#(not f), 263401#(or (not f) (= q2_back q2_front))] [2022-03-15 22:26:52,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:26:52,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:26:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:26:52,221 INFO L87 Difference]: Start difference. First operand 3991 states and 13386 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:53,248 INFO L93 Difference]: Finished difference Result 8044 states and 26367 transitions. [2022-03-15 22:26:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:26:53,248 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 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 28 [2022-03-15 22:26:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:53,264 INFO L225 Difference]: With dead ends: 8044 [2022-03-15 22:26:53,265 INFO L226 Difference]: Without dead ends: 7998 [2022-03-15 22:26:53,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 82 SyntacticMatches, 23 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=6011, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 22:26:53,291 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 370 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:53,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 15 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2022-03-15 22:26:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 4225. [2022-03-15 22:26:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 4224 states have (on average 3.330965909090909) internal successors, (14070), 4224 states have internal predecessors, (14070), 0 states have call successors, (0), 0 states have 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:26:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 14070 transitions. [2022-03-15 22:26:53,371 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 14070 transitions. Word has length 28 [2022-03-15 22:26:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:53,371 INFO L470 AbstractCegarLoop]: Abstraction has 4225 states and 14070 transitions. [2022-03-15 22:26:53,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 14070 transitions. [2022-03-15 22:26:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:53,377 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:53,377 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:53,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:53,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:53,593 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash 473294667, now seen corresponding path program 46 times [2022-03-15 22:26:53,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:53,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263635092] [2022-03-15 22:26:53,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:53,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:53,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263635092] [2022-03-15 22:26:53,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263635092] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:53,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170194995] [2022-03-15 22:26:53,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:26:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:53,667 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:53,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 22:26:53,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:26:53,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:53,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:26:53,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:53,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:53,917 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:26:53,918 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 14 treesize of output 13 [2022-03-15 22:26:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:53,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170194995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:53,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:53,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 22:26:53,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422882868] [2022-03-15 22:26:53,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:53,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:53,982 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 196 transitions. [2022-03-15 22:26:53,982 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:54,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [280165#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 280168#(or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (not (= (select q2 (+ q2_front 2)) 0))), 280167#(or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (not (= (select q2 (+ q2_front 2)) 0))), 280164#(or (not f) (= q2_back q2_front)), 280166#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (<= q2_back q2_front))] [2022-03-15 22:26:54,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:26:54,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:26:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:26:54,698 INFO L87 Difference]: Start difference. First operand 4225 states and 14070 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:26:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:55,554 INFO L93 Difference]: Finished difference Result 8326 states and 27254 transitions. [2022-03-15 22:26:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:26:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 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 22:26:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:55,571 INFO L225 Difference]: With dead ends: 8326 [2022-03-15 22:26:55,571 INFO L226 Difference]: Without dead ends: 8326 [2022-03-15 22:26:55,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 95 SyntacticMatches, 26 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=2895, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:26:55,573 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 272 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:55,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 17 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:26:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8326 states. [2022-03-15 22:26:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8326 to 3760. [2022-03-15 22:26:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 3759 states have (on average 3.329874966746475) internal successors, (12517), 3759 states have internal predecessors, (12517), 0 states have call successors, (0), 0 states have 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:26:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 12517 transitions. [2022-03-15 22:26:55,648 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 12517 transitions. Word has length 28 [2022-03-15 22:26:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:55,648 INFO L470 AbstractCegarLoop]: Abstraction has 3760 states and 12517 transitions. [2022-03-15 22:26:55,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:26:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 12517 transitions. [2022-03-15 22:26:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:55,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:55,653 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:55,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:55,867 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 539689313, now seen corresponding path program 47 times [2022-03-15 22:26:55,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:55,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941526751] [2022-03-15 22:26:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:55,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:55,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941526751] [2022-03-15 22:26:55,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941526751] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:55,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953477260] [2022-03-15 22:26:55,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:26:55,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:55,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:55,968 INFO L229 MonitoredProcess]: Starting monitored process 50 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:26:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 22:26:56,007 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:26:56,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:56,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:26:56,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:56,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:56,151 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:26:56,151 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 14 treesize of output 13 [2022-03-15 22:26:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:56,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953477260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:56,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:56,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 22:26:56,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956244322] [2022-03-15 22:26:56,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:56,183 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:56,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 198 transitions. [2022-03-15 22:26:56,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:56,824 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [296271#(or (not g) (<= q2_back q2_front) (not (= (select q2 (+ q2_front 2)) 0))), 296273#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 296272#(or (<= q2_back q2_front) (not (= (select q2 (+ q2_front 2)) 0))), 296275#(or (not f) (= q2_back q2_front)), 296274#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)))] [2022-03-15 22:26:56,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:26:56,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:26:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:26:56,825 INFO L87 Difference]: Start difference. First operand 3760 states and 12517 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:26:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:57,601 INFO L93 Difference]: Finished difference Result 8379 states and 27407 transitions. [2022-03-15 22:26:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:26:57,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 22:26:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:57,618 INFO L225 Difference]: With dead ends: 8379 [2022-03-15 22:26:57,618 INFO L226 Difference]: Without dead ends: 8379 [2022-03-15 22:26:57,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 97 SyntacticMatches, 26 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=517, Invalid=3023, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:26:57,619 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 237 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:57,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 17 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:26:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2022-03-15 22:26:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 3442. [2022-03-15 22:26:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3441 states have (on average 3.3458297006684106) internal successors, (11513), 3441 states have internal predecessors, (11513), 0 states have call successors, (0), 0 states have 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:26:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 11513 transitions. [2022-03-15 22:26:57,691 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 11513 transitions. Word has length 28 [2022-03-15 22:26:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:57,691 INFO L470 AbstractCegarLoop]: Abstraction has 3442 states and 11513 transitions. [2022-03-15 22:26:57,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:26:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 11513 transitions. [2022-03-15 22:26:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:26:57,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:57,695 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:57,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:57,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 22:26:57,912 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1697043957, now seen corresponding path program 48 times [2022-03-15 22:26:57,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:57,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25036336] [2022-03-15 22:26:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:57,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25036336] [2022-03-15 22:26:57,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25036336] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259493868] [2022-03-15 22:26:57,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:26:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:57,989 INFO L229 MonitoredProcess]: Starting monitored process 51 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:26:57,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 22:26:58,025 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:26:58,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:58,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:26:58,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:58,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:58,153 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 22:26:58,153 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 14 treesize of output 13 [2022-03-15 22:26:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:26:58,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259493868] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:58,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:58,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 11 [2022-03-15 22:26:58,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229561328] [2022-03-15 22:26:58,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:58,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:58,217 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 216 transitions. [2022-03-15 22:26:58,217 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:58,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [311799#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 311801#(or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))), 311800#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 311803#(or (not f) (= q2_back q2_front)), 311802#(or (<= q2_back (+ q2_front 2)) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))] [2022-03-15 22:26:58,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:26:58,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:26:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:26:58,806 INFO L87 Difference]: Start difference. First operand 3442 states and 11513 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:59,210 INFO L93 Difference]: Finished difference Result 5803 states and 19028 transitions. [2022-03-15 22:26:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 22:26:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 22:26:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:59,221 INFO L225 Difference]: With dead ends: 5803 [2022-03-15 22:26:59,222 INFO L226 Difference]: Without dead ends: 5803 [2022-03-15 22:26:59,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 105 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:26:59,235 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 168 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:59,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 17 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:26:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2022-03-15 22:26:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 3568. [2022-03-15 22:26:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3568 states, 3567 states have (on average 3.343986543313709) internal successors, (11928), 3567 states have internal predecessors, (11928), 0 states have call successors, (0), 0 states have 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:26:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 11928 transitions. [2022-03-15 22:26:59,311 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 11928 transitions. Word has length 28 [2022-03-15 22:26:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:59,311 INFO L470 AbstractCegarLoop]: Abstraction has 3568 states and 11928 transitions. [2022-03-15 22:26:59,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 11928 transitions. [2022-03-15 22:26:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:26:59,317 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:59,317 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:59,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 22:26:59,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 22:26:59,531 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 341233738, now seen corresponding path program 49 times [2022-03-15 22:26:59,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:59,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586961527] [2022-03-15 22:26:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:00,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:00,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586961527] [2022-03-15 22:27:00,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586961527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:00,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412965250] [2022-03-15 22:27:00,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:27:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:00,094 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:27:00,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 22:27:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:00,144 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 22:27:00,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:00,753 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:27:00,753 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 51 treesize of output 27 [2022-03-15 22:27:00,849 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:27:00,849 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 39 treesize of output 19 [2022-03-15 22:27:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:00,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:01,463 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:27:01,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 146 [2022-03-15 22:27:02,293 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:27:02,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 129 [2022-03-15 22:27:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:02,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412965250] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:02,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:02,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-03-15 22:27:02,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283775800] [2022-03-15 22:27:02,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:02,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:02,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 178 transitions. [2022-03-15 22:27:02,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:13,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [325004#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 325011#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N))), 325015#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 324998#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 325003#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 325007#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 324999#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 325013#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 325001#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 325010#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 324996#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= (+ (select q2 q2_front) t 1) N) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t 1))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back)))), 325008#(and (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (or (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not (< q2_front q2_back)) (= j 1)) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x))), 325006#(and (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x)) (or (not g) (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 325014#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 325009#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 324997#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 325012#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 325002#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 325005#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 325000#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))))] [2022-03-15 22:27:13,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:27:13,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:27:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=4909, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:27:13,734 INFO L87 Difference]: Start difference. First operand 3568 states and 11928 transitions. Second operand has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:30,731 INFO L93 Difference]: Finished difference Result 5770 states and 17750 transitions. [2022-03-15 22:27:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 22:27:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 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 29 [2022-03-15 22:27:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:30,740 INFO L225 Difference]: With dead ends: 5770 [2022-03-15 22:27:30,740 INFO L226 Difference]: Without dead ends: 5730 [2022-03-15 22:27:30,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4959 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1714, Invalid=19166, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 22:27:30,741 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 317 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:30,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 30 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:27:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2022-03-15 22:27:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 3607. [2022-03-15 22:27:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3606 states have (on average 3.3330560177481976) internal successors, (12019), 3606 states have internal predecessors, (12019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 12019 transitions. [2022-03-15 22:27:30,796 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 12019 transitions. Word has length 29 [2022-03-15 22:27:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:30,798 INFO L470 AbstractCegarLoop]: Abstraction has 3607 states and 12019 transitions. [2022-03-15 22:27:30,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 12019 transitions. [2022-03-15 22:27:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:27:30,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:30,803 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:30,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 22:27:31,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:31,016 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:27:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 407628384, now seen corresponding path program 50 times [2022-03-15 22:27:31,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:31,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689686198] [2022-03-15 22:27:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:31,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:31,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689686198] [2022-03-15 22:27:31,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689686198] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:31,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683748818] [2022-03-15 22:27:31,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:27:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:31,545 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:27:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 22:27:31,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:27:31,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:31,586 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 22:27:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:32,161 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:27:32,161 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 51 treesize of output 27 [2022-03-15 22:27:32,308 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:27:32,308 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 16 [2022-03-15 22:27:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:32,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:27:33,032 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:27:33,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 148 [2022-03-15 22:27:34,164 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:27:34,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 131 [2022-03-15 22:27:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:34,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683748818] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:34,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:34,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2022-03-15 22:27:34,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791790380] [2022-03-15 22:27:34,401 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:34,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:34,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 180 transitions. [2022-03-15 22:27:34,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:45,365 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [338384#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 338377#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 338366#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 338379#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 338385#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 338368#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 338373#(and (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (or (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not (< q2_front q2_back)) (= j 1)) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x))), 338370#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 338380#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 338381#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N))), 338382#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 338376#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 338378#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 338383#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 338367#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 338374#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 338371#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= (+ (select q2 q2_front) t 1) N) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t 1))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back)))), 338375#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 338369#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 338372#(and (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x)) (or (not g) (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t))))] [2022-03-15 22:27:45,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:27:45,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:27:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=5041, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 22:27:45,366 INFO L87 Difference]: Start difference. First operand 3607 states and 12019 transitions. Second operand has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:28:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:28:05,292 INFO L93 Difference]: Finished difference Result 5992 states and 18314 transitions. [2022-03-15 22:28:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 22:28:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 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 29 [2022-03-15 22:28:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:28:05,302 INFO L225 Difference]: With dead ends: 5992 [2022-03-15 22:28:05,302 INFO L226 Difference]: Without dead ends: 5934 [2022-03-15 22:28:05,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5312 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=1955, Invalid=20097, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 22:28:05,303 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 324 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:05,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 30 Invalid, 4349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 22:28:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2022-03-15 22:28:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 3599. [2022-03-15 22:28:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3599 states, 3598 states have (on average 3.3360200111172875) internal successors, (12003), 3598 states have internal predecessors, (12003), 0 states have call successors, (0), 0 states have 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:28:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 12003 transitions. [2022-03-15 22:28:05,358 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 12003 transitions. Word has length 29 [2022-03-15 22:28:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:28:05,358 INFO L470 AbstractCegarLoop]: Abstraction has 3599 states and 12003 transitions. [2022-03-15 22:28:05,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:28:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 12003 transitions. [2022-03-15 22:28:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:28:05,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:28:05,362 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:28:05,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 22:28:05,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 22:28:05,575 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:28:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:28:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1675790732, now seen corresponding path program 51 times [2022-03-15 22:28:05,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:28:05,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590234663] [2022-03-15 22:28:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:28:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:28:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:28:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:06,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:28:06,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590234663] [2022-03-15 22:28:06,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590234663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:28:06,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320086636] [2022-03-15 22:28:06,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:28:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:28:06,374 INFO L229 MonitoredProcess]: Starting monitored process 54 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:28:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 22:28:06,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:28:06,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:28:06,416 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 96 conjunts are in the unsatisfiable core [2022-03-15 22:28:06,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:28:07,066 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:28:07,066 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 47 treesize of output 27 [2022-03-15 22:28:07,212 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:28:07,213 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 16 [2022-03-15 22:28:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:07,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:28:07,886 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:28:07,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 146 [2022-03-15 22:28:08,694 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:28:08,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 129 [2022-03-15 22:28:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:08,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320086636] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:28:08,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:28:08,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-03-15 22:28:08,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876894901] [2022-03-15 22:28:08,942 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:28:08,945 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:28:08,965 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 178 transitions. [2022-03-15 22:28:08,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:28:19,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [351962#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 351960#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 351958#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 351953#(and (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (or (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not (< q2_front q2_back)) (= j 1)) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x))), 351965#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 351961#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 351955#(and (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= x (+ C y))) (or (not g) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ C y) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ (* 3 C) z) x))), 351966#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 351963#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N))), 351948#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 351959#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 351964#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 351957#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 351951#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 351949#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 351952#(and (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x)) (or (not g) (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 351947#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 351956#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 351954#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 351950#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 22:28:19,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:28:19,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:28:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:28:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=4913, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:28:19,662 INFO L87 Difference]: Start difference. First operand 3599 states and 12003 transitions. Second operand has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:28:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:28:39,811 INFO L93 Difference]: Finished difference Result 6025 states and 18378 transitions. [2022-03-15 22:28:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 22:28:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 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 29 [2022-03-15 22:28:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:28:39,822 INFO L225 Difference]: With dead ends: 6025 [2022-03-15 22:28:39,822 INFO L226 Difference]: Without dead ends: 5985 [2022-03-15 22:28:39,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5310 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=1793, Invalid=20259, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 22:28:39,824 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 323 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:39,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 31 Invalid, 4689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:28:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2022-03-15 22:28:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3607. [2022-03-15 22:28:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3606 states have (on average 3.3330560177481976) internal successors, (12019), 3606 states have internal predecessors, (12019), 0 states have call successors, (0), 0 states have 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:28:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 12019 transitions. [2022-03-15 22:28:39,882 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 12019 transitions. Word has length 29 [2022-03-15 22:28:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:28:39,882 INFO L470 AbstractCegarLoop]: Abstraction has 3607 states and 12019 transitions. [2022-03-15 22:28:39,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:28:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 12019 transitions. [2022-03-15 22:28:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:28:39,887 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:28:39,887 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:28:39,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 22:28:40,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 22:28:40,099 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:28:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:28:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1609396086, now seen corresponding path program 52 times [2022-03-15 22:28:40,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:28:40,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760534339] [2022-03-15 22:28:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:28:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:28:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:28:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:40,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:28:40,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760534339] [2022-03-15 22:28:40,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760534339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:28:40,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176010982] [2022-03-15 22:28:40,946 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:28:40,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:28:40,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:28:40,948 INFO L229 MonitoredProcess]: Starting monitored process 55 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:28:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 22:28:40,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:28:40,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:28:40,989 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 22:28:40,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:28:41,693 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:28:41,693 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 49 treesize of output 25 [2022-03-15 22:28:41,956 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:28:41,957 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 44 treesize of output 20 [2022-03-15 22:28:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:42,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:28:42,818 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:28:42,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 148 [2022-03-15 22:28:43,900 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:28:43,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 131 [2022-03-15 22:28:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:28:44,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176010982] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:28:44,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:28:44,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2022-03-15 22:28:44,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1645097772] [2022-03-15 22:28:44,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:28:44,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:28:44,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 180 transitions. [2022-03-15 22:28:44,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:28:55,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [365591#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 365597#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 365596#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 365585#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (not g) (not (< q2_front q2_back)) (= 1 (select q2 (+ q2_front 1)))) (or (not g) (not (< q2_front q2_back)) (<= x (+ C y))) (or (<= (+ (select q2 q2_front) t 1) N) (not g) (not (< q2_front q2_back))) (or (<= (+ C y) x) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t 1)))), 365587#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 365592#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 365595#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N))), 365588#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 365589#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 365580#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 365594#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 365582#(and (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x)) (or (not g) (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 365593#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 365598#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 365583#(and (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (or (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not (< q2_front q2_back)) (= j 1)) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x))), 365599#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 365584#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 365590#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 365581#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 365586#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))))] [2022-03-15 22:28:55,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:28:55,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:28:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:28:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=5051, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 22:28:55,341 INFO L87 Difference]: Start difference. First operand 3607 states and 12019 transitions. Second operand has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:29:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:29:13,406 INFO L93 Difference]: Finished difference Result 6030 states and 18385 transitions. [2022-03-15 22:29:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 22:29:13,406 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 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 29 [2022-03-15 22:29:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:29:13,416 INFO L225 Difference]: With dead ends: 6030 [2022-03-15 22:29:13,416 INFO L226 Difference]: Without dead ends: 5980 [2022-03-15 22:29:13,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5399 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1829, Invalid=20521, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 22:29:13,417 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 299 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 4857 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 4857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:13,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 31 Invalid, 5153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 4857 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:29:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2022-03-15 22:29:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3603. [2022-03-15 22:29:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3602 states have (on average 3.3339811215991118) internal successors, (12009), 3602 states have internal predecessors, (12009), 0 states have call successors, (0), 0 states have 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:29:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 12009 transitions. [2022-03-15 22:29:13,491 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 12009 transitions. Word has length 29 [2022-03-15 22:29:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:29:13,491 INFO L470 AbstractCegarLoop]: Abstraction has 3603 states and 12009 transitions. [2022-03-15 22:29:13,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:29:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 12009 transitions. [2022-03-15 22:29:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:29:13,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:29:13,496 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:29:13,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 22:29:13,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:13,711 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:29:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:29:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 448837940, now seen corresponding path program 53 times [2022-03-15 22:29:13,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:29:13,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949055869] [2022-03-15 22:29:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:29:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:29:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:29:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:14,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:29:14,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949055869] [2022-03-15 22:29:14,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949055869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:29:14,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786366714] [2022-03-15 22:29:14,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:29:14,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:14,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:29:14,241 INFO L229 MonitoredProcess]: Starting monitored process 56 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:29:14,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 22:29:14,280 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:29:14,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:29:14,281 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 22:29:14,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:29:14,797 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:29:14,797 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 45 treesize of output 25 [2022-03-15 22:29:15,017 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:29:15,017 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 36 treesize of output 16 [2022-03-15 22:29:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:15,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:29:15,726 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:29:15,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 151 [2022-03-15 22:29:16,579 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:29:16,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 137 [2022-03-15 22:29:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:16,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786366714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:29:16,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:29:16,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 54 [2022-03-15 22:29:16,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136321190] [2022-03-15 22:29:16,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:29:16,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:29:16,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 182 transitions. [2022-03-15 22:29:16,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:29:27,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [379215#(and (or (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (or (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not (< q2_front q2_back)) (= j 1)) (or (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x))), 379231#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 379228#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 379223#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ z (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ z (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N))), 379229#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 379212#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 379222#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< (+ (* 3 C) z) (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x (+ (* 3 C) z)) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)) (< y (+ x 1))) (or (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (<= x y) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 379226#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 379220#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1))))), 379218#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 379216#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 379225#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 379219#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 379230#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 379217#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 379224#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 379213#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x (+ z (* 2 C))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< y (+ x 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (< (+ z (* 2 C)) (+ x 1)) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= x y) (<= q2_back (+ q2_front 1)))), 379221#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 379227#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 379214#(and (or (not g) (not (< q2_front q2_back)) (<= x (+ z (* C 4)))) (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) y) x)) (or (not g) (not (< q2_front q2_back)) (<= (+ z (* C 4)) x)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) y))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t))))] [2022-03-15 22:29:27,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:29:27,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:29:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:29:27,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=5330, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:29:27,237 INFO L87 Difference]: Start difference. First operand 3603 states and 12009 transitions. Second operand has 41 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:29:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:29:51,376 INFO L93 Difference]: Finished difference Result 6068 states and 18404 transitions. [2022-03-15 22:29:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 22:29:51,377 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 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 29 [2022-03-15 22:29:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:29:51,387 INFO L225 Difference]: With dead ends: 6068 [2022-03-15 22:29:51,387 INFO L226 Difference]: Without dead ends: 5960 [2022-03-15 22:29:51,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5386 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=1915, Invalid=20435, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 22:29:51,388 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 295 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4221 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 4221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:51,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 31 Invalid, 4492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 4221 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 22:29:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2022-03-15 22:29:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3591. [2022-03-15 22:29:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3591 states, 3590 states have (on average 3.338718662952646) internal successors, (11986), 3590 states have internal predecessors, (11986), 0 states have call successors, (0), 0 states have 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:29:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 11986 transitions. [2022-03-15 22:29:51,448 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 11986 transitions. Word has length 29 [2022-03-15 22:29:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:29:51,448 INFO L470 AbstractCegarLoop]: Abstraction has 3591 states and 11986 transitions. [2022-03-15 22:29:51,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:29:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 11986 transitions. [2022-03-15 22:29:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:29:51,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:29:51,453 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:29:51,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 22:29:51,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:51,667 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:29:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:29:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2052686304, now seen corresponding path program 54 times [2022-03-15 22:29:51,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:29:51,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105282827] [2022-03-15 22:29:51,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:29:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:29:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:29:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:52,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:29:52,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105282827] [2022-03-15 22:29:52,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105282827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:29:52,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270433251] [2022-03-15 22:29:52,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:29:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:29:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:29:52,514 INFO L229 MonitoredProcess]: Starting monitored process 57 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:29:52,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 22:29:52,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:29:52,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:29:52,563 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 100 conjunts are in the unsatisfiable core [2022-03-15 22:29:52,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:29:53,460 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:29:53,460 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 47 treesize of output 27 [2022-03-15 22:29:53,607 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:29:53,607 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 16 [2022-03-15 22:29:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:53,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:29:54,610 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:29:54,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 149 [2022-03-15 22:29:56,367 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:29:56,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 168 [2022-03-15 22:29:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:29:56,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270433251] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:29:56,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:29:56,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-03-15 22:29:56,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276237453] [2022-03-15 22:29:56,818 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:29:56,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:29:56,896 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 190 transitions. [2022-03-15 22:29:56,896 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:30:09,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [392858#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 392865#(and (<= q2_back (+ q2_front 2)) (<= x (+ y (* 2 C))) (<= (+ y (* 2 C)) x) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (<= x (+ z (* C 4))) (= 1 (select q2 (+ q2_front 1))) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= z 0)), 392857#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 392867#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (<= x (+ (* 3 C) y)) (= z 0)), 392863#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (+ (* (- 1) t) z) 0) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 392859#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= 0 z) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= z t) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 392852#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z t) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 392869#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (<= i z) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (<= (+ 3 z) N) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3)))) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z)) (or (not (= (select q1 q1_back) 1)) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y)) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (< (+ 2 i) N)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))))), 392851#(and (or (not g) (not (< q2_front q2_back)) (<= (+ (* 3 C) z) x)) (or (= (+ q2_front 1) q2_back) (not g) (not (< q2_front q2_back))) (or (<= (+ y (* 2 C)) x) (not g) (not (< q2_front q2_back))) (or (<= (+ (select q2 q2_front) t 1) N) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= x (+ (* 3 C) z))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) t 1))) (or (<= x (+ y (* 2 C))) (not g) (not (< q2_front q2_back)))), 392864#(and (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (= (+ q2_front 2) q2_back)) (or (<= x (+ y (* 2 C))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ z (* C 4)) x)) (or (<= (+ y (* 2 C)) x) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= x (+ z (* C 4))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= (+ (select q2 q2_front) 1 (select q2 (+ q2_front 1))) N) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (= j 1)) (or (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) 1 (select q2 (+ q2_front 1)))))), 392862#(and (or (not g) (<= q2_back q2_front) (<= x (+ z (* 2 C)))) (or (<= (+ C y) x) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= x (+ C y))) (or (not g) (<= (+ z (* 2 C)) x) (<= q2_back q2_front)) (or (<= (+ (select q2 q2_front) t) N) (not g) (<= q2_back q2_front)) (or (not g) (<= q2_back q2_front) (<= N (+ (select q2 q2_front) t)))), 392870#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= z x) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (<= x y) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= z 0)) (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 3) q1_front) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= x z) (not (< 2 N))) (or (not (= (select q1 q1_back) 1)) (<= y x) (not (= (select q1 (+ q1_back 2)) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (< q1_front (+ q1_back 3))) (not (< 2 N)))), 392868#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= z 0)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= N (+ 3 z)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (* 3 C) z) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ y (* 2 C)) x) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ (* 3 C) z)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 z) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 392856#(and (or (not (= (select q1 q1_back) 1)) (<= i (+ z 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= (select q1 (+ q1_front 2)) 1)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (<= (+ C z) x) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ 3 z) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (<= x (+ C z)) (not (< (+ i 1) N)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (<= (+ C y) x) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= z t) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (<= x (+ C y)))), 392861#(and (or (not g) (<= x (+ z (* C 4))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (<= (+ z (* C 4)) x)) (or (not g) (= (select q2 q2_front) 0) (<= (+ (select q2 q2_front) t 1 (select q2 (+ q2_front 1))) N) (<= q2_back (+ q2_front 1))) (or (<= N (+ (select q2 q2_front) t 1 (select q2 (+ q2_front 1)))) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (<= x (+ y (* 2 C))) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (= (+ q2_front 2) q2_back)) (or (<= (+ y (* 2 C)) x) (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))) (or (not g) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (= j 1))), 392871#(and (= (select q1 q1_front) 1) (<= x (+ y (* C 4))) (<= (+ 3 z) N) (= (select q1 (+ q1_front 1)) 1) (<= x (+ z (* C 4))) (<= (+ y (* C 4)) x) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (= z 0) (= q2_back q2_front)), 392860#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (< y (+ x 1))) (or (<= x (+ C z)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (< (+ C z) (+ x 1)) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))) (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= x y))), 392866#(and (= (select q1 q1_front) 1) (<= (+ 3 z) N) (= (select q2 q2_front) 1) (<= x (+ z (* C 4))) (<= (+ q2_front 1) q2_back) (<= (+ (* 3 C) y) x) (<= q2_back (+ q2_front 1)) (<= N (+ 3 z)) (<= (+ z (* C 4)) x) (= j 1) (<= x (+ (* 3 C) y)) (= z 0)), 392853#(and (or (<= i (+ 3 z)) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 3 z) N) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) z)) (<= q1_back q1_front)) (or (<= (+ (* 3 C) z) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not (< q1_front q1_back))) (or (<= x (+ (* 3 C) y)) (not (< q1_front q1_back))) (or (= z 0) (not (< q1_front q1_back))) (or (<= (+ (* 3 C) y) x) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 2)) 1) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 392854#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (= z t) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C))))), 392855#(and (or (<= x (+ y (* 2 C))) (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) 1)) (<= (+ y (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ 3 z) N) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= (+ z (* 2 C)) x) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= i (+ 2 z)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 2)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (< i N)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (<= (+ q1_back 1) q1_front) (<= x (+ z (* 2 C)))) (or (not (= (select q1 q1_back) 1)) (not (< i N)) (= z 0) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 22:30:09,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:30:09,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:30:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:30:09,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=5049, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 22:30:09,573 INFO L87 Difference]: Start difference. First operand 3591 states and 11986 transitions. Second operand has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:30:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:30:40,483 INFO L93 Difference]: Finished difference Result 5949 states and 18180 transitions. [2022-03-15 22:30:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 22:30:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 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 29 [2022-03-15 22:30:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:30:40,492 INFO L225 Difference]: With dead ends: 5949 [2022-03-15 22:30:40,492 INFO L226 Difference]: Without dead ends: 5905 [2022-03-15 22:30:40,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6297 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=2107, Invalid=23975, Unknown=0, NotChecked=0, Total=26082 [2022-03-15 22:30:40,494 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 317 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 4752 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 4752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:30:40,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 35 Invalid, 5031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 4752 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 22:30:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5905 states. [2022-03-15 22:30:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5905 to 3613. [2022-03-15 22:30:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 3612 states have (on average 3.331118493909192) internal successors, (12032), 3612 states have internal predecessors, (12032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:30:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 12032 transitions. [2022-03-15 22:30:40,550 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 12032 transitions. Word has length 29 [2022-03-15 22:30:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:30:40,550 INFO L470 AbstractCegarLoop]: Abstraction has 3613 states and 12032 transitions. [2022-03-15 22:30:40,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:30:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 12032 transitions. [2022-03-15 22:30:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:30:40,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:30:40,555 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:30:40,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 22:30:40,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 22:30:40,771 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:30:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:30:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2119080950, now seen corresponding path program 55 times [2022-03-15 22:30:40,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:30:40,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312595044] [2022-03-15 22:30:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:30:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:30:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:30:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:30:41,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:30:41,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312595044] [2022-03-15 22:30:41,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312595044] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:30:41,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590896868] [2022-03-15 22:30:41,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:30:41,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:30:41,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:30:41,535 INFO L229 MonitoredProcess]: Starting monitored process 58 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:30:41,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 22:30:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:30:41,573 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 22:30:41,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:30:42,327 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:30:42,328 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 51 treesize of output 27 [2022-03-15 22:30:42,549 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 22:30:42,549 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 44 treesize of output 20 Received shutdown request... [2022-03-15 22:30:42,651 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:30:42,652 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:30:42,668 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:30:42,668 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:30:42,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-15 22:30:42,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:30:42,853 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 4ms.. [2022-03-15 22:30:42,854 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:30:42,855 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:30:42,855 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:30:42,857 INFO L732 BasicCegarLoop]: Path program histogram: [55, 4, 1, 1] [2022-03-15 22:30:42,858 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:30:42,858 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:30:42,860 INFO L202 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:30:42 BasicIcfg [2022-03-15 22:30:42,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:30:42,860 INFO L158 Benchmark]: Toolchain (without parser) took 864163.07ms. Allocated memory was 202.4MB in the beginning and 729.8MB in the end (delta: 527.4MB). Free memory was 163.2MB in the beginning and 489.8MB in the end (delta: -326.7MB). Peak memory consumption was 200.9MB. Max. memory is 8.0GB. [2022-03-15 22:30:42,860 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:30:42,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 202.4MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:30:42,860 INFO L158 Benchmark]: Boogie Preprocessor took 30.72ms. Allocated memory is still 202.4MB. Free memory was 161.6MB in the beginning and 160.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:30:42,860 INFO L158 Benchmark]: RCFGBuilder took 278.35ms. Allocated memory is still 202.4MB. Free memory was 160.5MB in the beginning and 150.2MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 22:30:42,860 INFO L158 Benchmark]: TraceAbstraction took 863806.95ms. Allocated memory was 202.4MB in the beginning and 729.8MB in the end (delta: 527.4MB). Free memory was 149.7MB in the beginning and 489.8MB in the end (delta: -340.1MB). Peak memory consumption was 188.3MB. Max. memory is 8.0GB. [2022-03-15 22:30:42,861 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.11ms. Allocated memory is still 202.4MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 202.4MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.72ms. Allocated memory is still 202.4MB. Free memory was 161.6MB in the beginning and 160.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 278.35ms. Allocated memory is still 202.4MB. Free memory was 160.5MB in the beginning and 150.2MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 863806.95ms. Allocated memory was 202.4MB in the beginning and 729.8MB in the end (delta: 527.4MB). Free memory was 149.7MB in the beginning and 489.8MB in the end (delta: -340.1MB). Peak memory consumption was 188.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 49 PlacesBefore, 29 PlacesAfterwards, 42 TransitionsBefore, 22 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 665 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 611, positive: 596, positive conditional: 0, positive unconditional: 596, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 341, positive: 332, positive conditional: 0, positive unconditional: 332, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 611, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 341, unknown conditional: 0, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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: 96]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 4ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 4ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 4ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 28 for 4ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 71 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 863.7s, OverallIterations: 61, TraceHistogramMax: 4, PathProgramHistogramMax: 55, EmptinessCheckTime: 0.2s, AutomataDifference: 495.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12251 SdHoareTripleChecker+Valid, 65.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12251 mSDsluCounter, 1169 SdHoareTripleChecker+Invalid, 57.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60919 mSDsCounter, 7481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124697 IncrementalHoareTripleChecker+Invalid, 132178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7481 mSolverCounterUnsat, 172 mSDtfsCounter, 124697 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9431 GetRequests, 3846 SyntacticMatches, 678 SemanticMatches, 4907 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137790 ImplicationChecksByTransitivity, 520.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4225occurred in iteration=51, InterpolantAutomatonStates: 3122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 60 MinimizatonAttempts, 77965 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 88.5s InterpolantComputationTime, 2850 NumberOfCodeBlocks, 2850 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 4053 ConstructedInterpolants, 115 QuantifiedInterpolants, 101464 SizeOfPredicates, 599 NumberOfNonLiveVariables, 8368 ConjunctsInSsa, 2928 ConjunctsInUnsatCore, 171 InterpolantComputations, 5 PerfectInterpolantSequences, 490/3125 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