/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/three-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:44:53,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:44:53,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:44:53,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:44:53,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:44:53,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:44:53,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:44:53,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:44:53,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:44:53,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:44:53,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:44:53,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:44:53,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:44:53,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:44:53,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:44:53,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:44:53,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:44:53,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:44:53,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:44:53,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:44:53,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:44:53,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:44:53,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:44:53,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:44:53,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:44:53,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:44:53,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:44:53,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:44:53,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:44:53,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:44:53,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:44:53,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:44:53,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:44:53,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:44:53,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:44:53,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:44:53,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:44:53,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:44:53,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:44:53,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:44:53,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:44:53,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:44:53,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:44:53,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:44:53,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:44:53,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:44:53,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:44:53,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:44:53,210 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:44:53,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:44:53,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:44:53,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:44:53,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:44:53,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:44:53,213 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:44:53,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:44:53,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:44:53,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:44:53,404 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:44:53,407 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:44:53,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl [2022-03-15 21:44:53,408 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl' [2022-03-15 21:44:53,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:44:53,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:44:53,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:44:53,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:44:53,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:44:53,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,446 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:44:53,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:44:53,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:44:53,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:44:53,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:44:53,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:44:53,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:44:53,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:44:53,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:44:53,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/1) ... [2022-03-15 21:44:53,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:44:53,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:53,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:44:53,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:44:53,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:44:53,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:44:53,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:44:53,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:44:53,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:44:53,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:44:53,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:44:53,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:44:53,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:44:53,523 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:44:53,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:44:53,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:44:53,525 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:44:53,567 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:44:53,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:44:53,719 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:44:53,734 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:44:53,734 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:44:53,736 INFO L202 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:44:53 BoogieIcfgContainer [2022-03-15 21:44:53,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:44:53,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:44:53,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:44:53,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:44:53,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:53" (1/2) ... [2022-03-15 21:44:53,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767bd0ae and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:44:53, skipping insertion in model container [2022-03-15 21:44:53,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:44:53" (2/2) ... [2022-03-15 21:44:53,755 INFO L111 eAbstractionObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2022-03-15 21:44:53,759 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:44:53,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:44:53,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:44:53,759 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:44:53,812 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:44:53,882 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:44:53,888 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:44:53,888 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:44:53,896 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:44:53,905 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 82 flow [2022-03-15 21:44:53,907 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 82 flow [2022-03-15 21:44:53,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 82 flow [2022-03-15 21:44:53,940 INFO L129 PetriNetUnfolder]: 4/26 cut-off events. [2022-03-15 21:44:53,940 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:44:53,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2022-03-15 21:44:53,943 INFO L116 LiptonReduction]: Number of co-enabled transitions 184 [2022-03-15 21:44:54,169 INFO L131 LiptonReduction]: Checked pairs total: 176 [2022-03-15 21:44:54,170 INFO L133 LiptonReduction]: Total number of compositions: 11 [2022-03-15 21:44:54,179 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 64 flow [2022-03-15 21:44:54,195 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 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 21:44:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 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 21:44:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:44:54,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:54,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:54,202 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1565570324, now seen corresponding path program 1 times [2022-03-15 21:44:54,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:54,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670615839] [2022-03-15 21:44:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:54,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:54,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670615839] [2022-03-15 21:44:54,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670615839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:54,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:44:54,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:44:54,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915461928] [2022-03-15 21:44:54,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:54,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:54,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:44:54,428 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:54,825 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:44:54,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:44:54,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:44:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:44:54,845 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 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) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:54,878 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2022-03-15 21:44:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:44:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 21:44:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:54,885 INFO L225 Difference]: With dead ends: 59 [2022-03-15 21:44:54,885 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 21:44:54,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:44:54,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:54,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:44:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 21:44:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-03-15 21:44:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 136 transitions. [2022-03-15 21:44:54,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 136 transitions. Word has length 11 [2022-03-15 21:44:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:54,912 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 136 transitions. [2022-03-15 21:44:54,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 136 transitions. [2022-03-15 21:44:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:44:54,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:54,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:54,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:44:54,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1262331017, now seen corresponding path program 1 times [2022-03-15 21:44:54,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:54,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754144696] [2022-03-15 21:44:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:54,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:54,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754144696] [2022-03-15 21:44:54,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754144696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:54,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775081840] [2022-03-15 21:44:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:54,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:54,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:44:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:54,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:44:54,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:55,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:55,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775081840] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:55,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:55,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-03-15 21:44:55,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114913795] [2022-03-15 21:44:55,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:55,079 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:55,081 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:44:55,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:55,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [326#(or (< k N) (< i N)), 328#(or (<= N i) (< (+ i 1) N) (< k N)), 325#(< i N), 327#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:44:55,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:44:55,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:44:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:44:55,336 INFO L87 Difference]: Start difference. First operand 46 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:55,538 INFO L93 Difference]: Finished difference Result 145 states and 414 transitions. [2022-03-15 21:44:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:44:55,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:44:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:55,540 INFO L225 Difference]: With dead ends: 145 [2022-03-15 21:44:55,541 INFO L226 Difference]: Without dead ends: 145 [2022-03-15 21:44:55,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:44:55,543 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:55,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:44:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-15 21:44:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 83. [2022-03-15 21:44:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 3.268292682926829) internal successors, (268), 82 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 268 transitions. [2022-03-15 21:44:55,553 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 268 transitions. Word has length 12 [2022-03-15 21:44:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:55,553 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 268 transitions. [2022-03-15 21:44:55,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 268 transitions. [2022-03-15 21:44:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:44:55,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:55,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:55,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:44:55,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:55,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1610160841, now seen corresponding path program 1 times [2022-03-15 21:44:55,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:55,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236651576] [2022-03-15 21:44:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:55,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:55,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236651576] [2022-03-15 21:44:55,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236651576] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:55,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:44:55,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:44:55,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923420296] [2022-03-15 21:44:55,780 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:55,781 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:55,785 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 21:44:55,785 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:55,976 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [654#(< i N), 657#(or (< (+ l 1) N) (<= N l)), 658#(or (<= N l) (< i N)), 655#(< l N), 656#(< (+ l 1) N)] [2022-03-15 21:44:55,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:44:55,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:44:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:44:55,978 INFO L87 Difference]: Start difference. First operand 83 states and 268 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:56,093 INFO L93 Difference]: Finished difference Result 108 states and 326 transitions. [2022-03-15 21:44:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:44:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:44:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:56,094 INFO L225 Difference]: With dead ends: 108 [2022-03-15 21:44:56,094 INFO L226 Difference]: Without dead ends: 90 [2022-03-15 21:44:56,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:44:56,095 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:56,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:44:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-03-15 21:44:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-03-15 21:44:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 3.2222222222222223) internal successors, (232), 72 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 232 transitions. [2022-03-15 21:44:56,101 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 232 transitions. Word has length 13 [2022-03-15 21:44:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:56,101 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 232 transitions. [2022-03-15 21:44:56,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 232 transitions. [2022-03-15 21:44:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:44:56,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:56,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:56,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:44:56,102 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1070443025, now seen corresponding path program 1 times [2022-03-15 21:44:56,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:56,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372681363] [2022-03-15 21:44:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:56,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:56,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372681363] [2022-03-15 21:44:56,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372681363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:56,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408939600] [2022-03-15 21:44:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:56,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:56,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:56,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:44:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:56,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:44:56,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:56,342 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 20 treesize of output 16 [2022-03-15 21:44:56,345 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 24 treesize of output 20 [2022-03-15 21:44:56,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-03-15 21:44:56,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 21:44:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:56,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:56,445 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 31 treesize of output 29 [2022-03-15 21:44:56,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:44:56,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:44:56,481 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 18 treesize of output 23 [2022-03-15 21:44:56,487 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:44:56,487 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 19 [2022-03-15 21:44:56,514 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 18 treesize of output 12 [2022-03-15 21:44:56,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2022-03-15 21:44:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:56,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408939600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:56,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:56,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 21:44:56,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734017645] [2022-03-15 21:44:56,536 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:56,537 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:56,543 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 108 transitions. [2022-03-15 21:44:56,543 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:57,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1015#(and (< (+ (select C l) csum) (+ (select A i) asum bsum (select B i) 1)) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum))), 1018#(and (= l k) (<= (+ (select A i) asum bsum (select B i)) (+ csum (select A k) (select B k))) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B i) 1))), 1014#(and (<= (+ (select A i) asum bsum (select B i)) csum) (< csum (+ (select A i) asum bsum (select B i) 1))), 1016#(and (or (and (not (= l k)) (<= (+ (select C l) csum) (+ asum bsum))) (and (= l k) (<= (+ csum (select A k) (select B k)) (+ asum bsum)))) (or (and (= l k) (<= (+ asum bsum) (+ csum (select A k) (select B k)))) (and (<= (+ asum bsum) (+ (select C l) csum)) (not (= l k))))), 1017#(and (or (and (< (+ (select C l) csum) (+ (select A i) asum bsum (select B i) 1)) (not (= l k))) (and (= l k) (< (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B i) 1)))) (or (and (= l k) (<= (+ (select A i) asum bsum (select B i)) (+ csum (select A k) (select B k)))) (and (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum)) (not (= l k)))))] [2022-03-15 21:44:57,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:44:57,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:44:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:44:57,459 INFO L87 Difference]: Start difference. First operand 73 states and 232 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:57,735 INFO L93 Difference]: Finished difference Result 179 states and 579 transitions. [2022-03-15 21:44:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:44:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:44:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:57,737 INFO L225 Difference]: With dead ends: 179 [2022-03-15 21:44:57,737 INFO L226 Difference]: Without dead ends: 173 [2022-03-15 21:44:57,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:44:57,738 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:57,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-15 21:44:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 125. [2022-03-15 21:44:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 3.4193548387096775) internal successors, (424), 124 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 424 transitions. [2022-03-15 21:44:57,746 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 424 transitions. Word has length 15 [2022-03-15 21:44:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:57,746 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 424 transitions. [2022-03-15 21:44:57,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 424 transitions. [2022-03-15 21:44:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:44:57,747 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:57,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:57,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:57,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 21:44:57,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash -412645585, now seen corresponding path program 2 times [2022-03-15 21:44:57,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:57,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039008401] [2022-03-15 21:44:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:57,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:57,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039008401] [2022-03-15 21:44:57,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039008401] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:57,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477856294] [2022-03-15 21:44:57,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:44:57,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:57,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:57,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:44:58,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:44:58,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:58,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:44:58,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:44:58,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:44:58,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477856294] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:58,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:44:58,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-03-15 21:44:58,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657202397] [2022-03-15 21:44:58,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:58,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:58,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 77 transitions. [2022-03-15 21:44:58,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:58,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:44:58,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:44:58,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:58,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:44:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:44:58,174 INFO L87 Difference]: Start difference. First operand 125 states and 424 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:58,191 INFO L93 Difference]: Finished difference Result 131 states and 423 transitions. [2022-03-15 21:44:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:44:58,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:44:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:58,193 INFO L225 Difference]: With dead ends: 131 [2022-03-15 21:44:58,193 INFO L226 Difference]: Without dead ends: 116 [2022-03-15 21:44:58,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:44:58,193 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:58,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:44:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-15 21:44:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2022-03-15 21:44:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 3.1574074074074074) internal successors, (341), 108 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 341 transitions. [2022-03-15 21:44:58,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 341 transitions. Word has length 15 [2022-03-15 21:44:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:58,199 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 341 transitions. [2022-03-15 21:44:58,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 341 transitions. [2022-03-15 21:44:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:44:58,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:58,200 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:58,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:58,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:58,423 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -533992146, now seen corresponding path program 3 times [2022-03-15 21:44:58,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:58,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047166358] [2022-03-15 21:44:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:58,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:58,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047166358] [2022-03-15 21:44:58,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047166358] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:58,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307931750] [2022-03-15 21:44:58,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:44:58,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:58,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:58,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:44:58,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:44:58,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:58,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:44:58,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:58,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:58,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307931750] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:58,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:58,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:44:58,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041422654] [2022-03-15 21:44:58,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:58,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:58,553 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:44:58,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:59,266 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1946#(< i N), 1953#(or (<= (+ 2 k) N) (<= N k) (< i N)), 1955#(or (<= (+ 2 k) N) (< i N)), 1952#(or (<= (+ 2 k) N) (<= N k)), 1958#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 1957#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 1954#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 1947#(or (<= N i) (< (+ i 1) N)), 1950#(or (<= N i) (< (+ i 1) N) (< k N)), 1951#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 1949#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1948#(or (< k N) (< i N)), 1956#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N))] [2022-03-15 21:44:59,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:44:59,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:44:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:44:59,267 INFO L87 Difference]: Start difference. First operand 109 states and 341 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:59,861 INFO L93 Difference]: Finished difference Result 315 states and 1090 transitions. [2022-03-15 21:44:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:44:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:44:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:59,863 INFO L225 Difference]: With dead ends: 315 [2022-03-15 21:44:59,863 INFO L226 Difference]: Without dead ends: 315 [2022-03-15 21:44:59,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:44:59,864 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:59,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-03-15 21:44:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 259. [2022-03-15 21:44:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 3.6666666666666665) internal successors, (946), 258 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 946 transitions. [2022-03-15 21:44:59,874 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 946 transitions. Word has length 16 [2022-03-15 21:44:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:59,874 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 946 transitions. [2022-03-15 21:44:59,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 946 transitions. [2022-03-15 21:44:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:44:59,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:59,876 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:59,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 21:45:00,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:00,092 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1271148943, now seen corresponding path program 4 times [2022-03-15 21:45:00,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:00,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319164828] [2022-03-15 21:45:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:45:00,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:00,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319164828] [2022-03-15 21:45:00,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319164828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:00,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310672025] [2022-03-15 21:45:00,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:45:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:00,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:00,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:45:00,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:45:00,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:00,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:45:00,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:00,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:00,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310672025] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:00,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:00,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-15 21:45:00,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518906824] [2022-03-15 21:45:00,216 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:00,217 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:00,223 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 138 transitions. [2022-03-15 21:45:00,224 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:00,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [2947#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 2940#(or (<= N i) (< (+ i 1) N) (< k N)), 2949#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 2944#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 2951#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 2938#(or (< k N) (< i N)), 2943#(or (<= N k) (< (+ k 1) N) (< i N)), 2950#(or (<= N i) (< (+ i 1) N) (<= N k)), 2955#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 2948#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 2952#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 2945#(or (<= (+ N 1) k) (< i N)), 2942#(or (<= N (+ k 1)) (< (+ 2 k) N)), 2937#(< k N), 2946#(or (<= N k) (< i N)), 2939#(or (<= N i) (< (+ i 1) N)), 2936#(< i N), 2954#(or (<= N (+ k 1)) (< i N)), 2953#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 2941#(or (<= N k) (< (+ k 1) N))] [2022-03-15 21:45:00,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:45:00,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:45:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:45:00,963 INFO L87 Difference]: Start difference. First operand 259 states and 946 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 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 21:45:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:01,516 INFO L93 Difference]: Finished difference Result 450 states and 1476 transitions. [2022-03-15 21:45:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:45:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 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 17 [2022-03-15 21:45:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:01,519 INFO L225 Difference]: With dead ends: 450 [2022-03-15 21:45:01,519 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 21:45:01,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1592, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:45:01,520 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 483 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:01,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:45:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 21:45:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 275. [2022-03-15 21:45:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.5) internal successors, (959), 274 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 959 transitions. [2022-03-15 21:45:01,530 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 959 transitions. Word has length 17 [2022-03-15 21:45:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:01,530 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 959 transitions. [2022-03-15 21:45:01,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 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 21:45:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 959 transitions. [2022-03-15 21:45:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:45:01,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:01,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:01,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:01,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:01,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1862930204, now seen corresponding path program 5 times [2022-03-15 21:45:01,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:01,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406835845] [2022-03-15 21:45:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:45:01,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:01,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406835845] [2022-03-15 21:45:01,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406835845] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:01,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352112849] [2022-03-15 21:45:01,787 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:45:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:01,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:01,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:45:01,814 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:45:01,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:01,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:45:01,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:45:01,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:45:01,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352112849] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:01,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:01,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-15 21:45:01,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019542479] [2022-03-15 21:45:01,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:01,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:01,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 148 transitions. [2022-03-15 21:45:01,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:02,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4103#(or (<= N (+ l 1)) (< i N)), 4098#(< (+ l 1) N), 4099#(or (< (+ l 1) N) (<= N l)), 4100#(or (< (+ 2 l) N) (<= N (+ l 1))), 4104#(or (<= N i) (< (+ i 1) N)), 4101#(< i N), 4105#(or (<= N i) (< (+ i 1) N) (<= N l)), 4102#(or (<= N l) (< i N)), 4106#(or (<= N (+ l 1)) (<= N i) (< (+ i 1) N)), 4097#(< l N)] [2022-03-15 21:45:02,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:45:02,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:45:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:45:02,548 INFO L87 Difference]: Start difference. First operand 275 states and 959 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:02,974 INFO L93 Difference]: Finished difference Result 526 states and 1754 transitions. [2022-03-15 21:45:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:45:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:45:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:02,977 INFO L225 Difference]: With dead ends: 526 [2022-03-15 21:45:02,977 INFO L226 Difference]: Without dead ends: 500 [2022-03-15 21:45:02,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:45:02,978 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:02,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-03-15 21:45:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 360. [2022-03-15 21:45:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 3.6100278551532035) internal successors, (1296), 359 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1296 transitions. [2022-03-15 21:45:02,989 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 1296 transitions. Word has length 17 [2022-03-15 21:45:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:02,989 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 1296 transitions. [2022-03-15 21:45:02,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1296 transitions. [2022-03-15 21:45:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:45:02,992 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:02,996 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:03,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:03,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:03,212 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -153404489, now seen corresponding path program 6 times [2022-03-15 21:45:03,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:03,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75469867] [2022-03-15 21:45:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:45:03,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:03,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75469867] [2022-03-15 21:45:03,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75469867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:03,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641646856] [2022-03-15 21:45:03,264 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:45:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:03,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:03,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:45:03,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 21:45:03,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:03,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:45:03,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:45:03,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:45:03,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641646856] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:03,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:03,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:45:03,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910769251] [2022-03-15 21:45:03,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:03,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:03,363 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 158 transitions. [2022-03-15 21:45:03,363 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:04,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5492#(< i N), 5499#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 5494#(or (<= (+ 2 l) N) (< i N)), 5496#(or (<= N i) (< (+ i 1) N)), 5500#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 5498#(or (<= N i) (< (+ i 1) N) (< l N)), 5495#(or (<= (+ 2 l) N) (<= N l)), 5501#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 5497#(or (<= N (+ i 1)) (< (+ 2 i) N)), 5493#(or (<= (+ l 1) N) (< i N))] [2022-03-15 21:45:04,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:45:04,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:45:04,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:45:04,190 INFO L87 Difference]: Start difference. First operand 360 states and 1296 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 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 21:45:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:04,669 INFO L93 Difference]: Finished difference Result 782 states and 2842 transitions. [2022-03-15 21:45:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:45:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 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 17 [2022-03-15 21:45:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:04,674 INFO L225 Difference]: With dead ends: 782 [2022-03-15 21:45:04,674 INFO L226 Difference]: Without dead ends: 782 [2022-03-15 21:45:04,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:45:04,676 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:04,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:45:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-03-15 21:45:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 596. [2022-03-15 21:45:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 3.838655462184874) internal successors, (2284), 595 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 2284 transitions. [2022-03-15 21:45:04,692 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 2284 transitions. Word has length 17 [2022-03-15 21:45:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:04,692 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 2284 transitions. [2022-03-15 21:45:04,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 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 21:45:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 2284 transitions. [2022-03-15 21:45:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:45:04,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:04,693 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:04,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:04,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:04,913 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash -705032449, now seen corresponding path program 7 times [2022-03-15 21:45:04,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:04,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854992098] [2022-03-15 21:45:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:04,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:04,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854992098] [2022-03-15 21:45:04,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854992098] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:04,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787918068] [2022-03-15 21:45:04,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:45:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:04,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:04,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:45:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:05,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:45:05,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:05,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:05,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787918068] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:05,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:05,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-03-15 21:45:05,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651526511] [2022-03-15 21:45:05,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:05,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:05,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:45:05,078 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:06,208 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [7628#(or (< k N) (< l N)), 7639#(or (< (+ l 1) N) (<= N i)), 7635#(or (< (+ l 1) N) (not (< l N)) (<= (+ N 1) i)), 7637#(or (< (+ l 1) N) (<= (+ N 1) i) (<= N k) (< (+ k 1) N) (<= N l)), 7629#(or (< (+ l 1) N) (< k N)), 7641#(or (<= N i) (< k N)), 7632#(or (<= (+ N 1) i) (< k N) (< l N)), 7627#(< k N), 7643#(or (< (+ l 1) N) (<= N i) (< k N)), 7623#(or (<= (+ N 1) i) (< l N)), 7631#(or (<= (+ N 1) i) (< k N)), 7626#(or (< (+ l 1) N) (<= N l)), 7638#(or (<= N i) (< l N)), 7646#(or (<= N (+ i 1)) (< k N)), 7647#(and (or (<= N (+ l 1)) (< k N)) (or (< k N) (= (+ l (* (- 1) i)) 0))), 7633#(or (< (+ l 1) N) (<= (+ N 1) i) (< k N)), 7630#(or (< (+ l 1) N) (< k N) (<= N l)), 7625#(or (< (+ l 1) N) (<= (+ N 1) i)), 7648#(and (or (<= N k) (= (+ l (* (- 1) i)) 0) (< (+ k 1) N)) (or (<= N (+ l 1)) (<= N k) (< (+ k 1) N))), 7622#(< l N), 7624#(< (+ l 1) N), 7642#(or (<= N i) (< k N) (< l N)), 7645#(or (< (+ l 1) N) (<= N i) (<= N k) (< (+ k 1) N) (<= N l)), 7640#(or (< (+ l 1) N) (<= N i) (<= N l)), 7644#(or (< (+ l 1) N) (<= N i) (< k N) (<= N l)), 7634#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N) (<= N l)), 7636#(or (< (+ l 1) N) (not (< l N)) (<= (+ N 1) i) (< k N))] [2022-03-15 21:45:06,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:45:06,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:45:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:45:06,210 INFO L87 Difference]: Start difference. First operand 596 states and 2284 transitions. Second operand has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 34 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 21:45:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:07,623 INFO L93 Difference]: Finished difference Result 866 states and 3208 transitions. [2022-03-15 21:45:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 21:45:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 34 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 17 [2022-03-15 21:45:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:07,628 INFO L225 Difference]: With dead ends: 866 [2022-03-15 21:45:07,628 INFO L226 Difference]: Without dead ends: 842 [2022-03-15 21:45:07,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1374, Invalid=5432, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:45:07,630 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 398 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:07,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 0 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:45:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-03-15 21:45:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 613. [2022-03-15 21:45:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 3.8251633986928106) internal successors, (2341), 612 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 2341 transitions. [2022-03-15 21:45:07,652 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 2341 transitions. Word has length 17 [2022-03-15 21:45:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:07,653 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 2341 transitions. [2022-03-15 21:45:07,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 34 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 21:45:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 2341 transitions. [2022-03-15 21:45:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:45:07,655 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:07,655 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:07,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:07,867 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,SelfDestructingSolverStorable9 [2022-03-15 21:45:07,868 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 671668530, now seen corresponding path program 8 times [2022-03-15 21:45:07,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:07,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523601570] [2022-03-15 21:45:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:45:07,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:07,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523601570] [2022-03-15 21:45:07,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523601570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:07,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894805601] [2022-03-15 21:45:07,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:45:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:07,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:07,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:45:07,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:45:07,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:07,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:45:07,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:45:07,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:45:07,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894805601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:07,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:07,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-03-15 21:45:07,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927278513] [2022-03-15 21:45:07,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:07,999 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:08,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 21:45:08,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:08,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9946#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= N k) (< (+ k 1) N)), 9943#(or (< k N) (< l N)), 9942#(or (<= N k) (< (+ k 1) N)), 9945#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N)), 9941#(< k N), 9944#(or (<= N k) (< (+ k 1) N) (< l N))] [2022-03-15 21:45:08,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:45:08,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:45:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:45:08,703 INFO L87 Difference]: Start difference. First operand 613 states and 2341 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:08,834 INFO L93 Difference]: Finished difference Result 790 states and 2827 transitions. [2022-03-15 21:45:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:45:08,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:45:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:08,838 INFO L225 Difference]: With dead ends: 790 [2022-03-15 21:45:08,838 INFO L226 Difference]: Without dead ends: 777 [2022-03-15 21:45:08,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:45:08,839 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:08,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:45:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-03-15 21:45:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 625. [2022-03-15 21:45:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 3.7740384615384617) internal successors, (2355), 624 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 2355 transitions. [2022-03-15 21:45:08,852 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 2355 transitions. Word has length 18 [2022-03-15 21:45:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:08,853 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 2355 transitions. [2022-03-15 21:45:08,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 2355 transitions. [2022-03-15 21:45:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:45:08,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:08,854 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:08,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 21:45:09,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:09,067 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1728458942, now seen corresponding path program 9 times [2022-03-15 21:45:09,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:09,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867250731] [2022-03-15 21:45:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:09,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:09,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867250731] [2022-03-15 21:45:09,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867250731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:09,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669013919] [2022-03-15 21:45:09,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:45:09,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:09,317 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:09,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:45:09,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:45:09,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:09,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 21:45:09,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:09,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-03-15 21:45:09,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:09,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-03-15 21:45:09,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:09,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2022-03-15 21:45:09,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:09,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2022-03-15 21:45:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-03-15 21:45:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:09,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:09,773 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:45: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 2070 treesize of output 1974 [2022-03-15 21:45:10,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:10,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:10,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,292 INFO L353 Elim1Store]: treesize reduction 14, result has 72.5 percent of original size [2022-03-15 21:45:10,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 64 [2022-03-15 21:45:10,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,310 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:45:10,311 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 27 treesize of output 56 [2022-03-15 21:45:10,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:10,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-03-15 21:45:10,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:10,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:45:10,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, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 5 [2022-03-15 21:45:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:10,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669013919] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:10,487 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:10,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-03-15 21:45:10,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903254558] [2022-03-15 21:45:10,488 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:10,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:10,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 208 transitions. [2022-03-15 21:45:10,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:18,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [12141#(and (or (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< k N)) (or (<= (+ 2 l) N) (< k N) (<= (+ (select C l) csum) (+ asum bsum)))), 12154#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< l N)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< l N))), 12142#(and (or (<= (+ 2 l) N) (<= N l) (<= (+ (select C l) csum) (+ asum bsum))) (or (not (< l N)) (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N))), 12178#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) (select A k) (select B k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ (- 1) N) k)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= l k))) (or (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N))), 12156#(and (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N))) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) asum bsum (select B i) 1))) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum (select C (+ l 1)))))), 12147#(and (or (<= N (+ l 1)) (<= (+ (select C l) csum (select C (+ l 1))) (+ asum bsum)) (<= (+ 3 l) N)) (or (not (< (+ l 1) N)) (<= (+ 3 l) N) (<= (+ asum bsum) (+ (select C l) csum (select C (+ l 1)))))), 12140#(and (or (<= (+ l 1) N) (< k N) (< csum (+ asum bsum 1))) (or (<= (+ l 1) N) (< k N) (<= (+ asum bsum) csum))), 12160#(and (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum (select C (+ l 1))))) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< k N)) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< k N) (= csum 0)) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< k N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) asum bsum (select B i) 1)))), 12169#(and (or (not (< k N)) (< (+ 2 l) N) (<= (+ asum bsum) (+ (select C l) (select A k) (select B k))) (< (+ k 1) N)) (or (not (< k N)) (<= (+ 2 l) N) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) (select B k)) (+ asum bsum)) (<= (+ 3 l) N) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (= csum 0) (< (+ k 1) N))), 12148#(and (or (<= N (+ l 1)) (<= (+ (select C l) csum (select C (+ l 1))) (+ asum bsum)) (< k N) (<= (+ 3 l) N)) (or (not (< (+ l 1) N)) (< k N) (<= (+ 3 l) N) (<= (+ asum bsum) (+ (select C l) csum (select C (+ l 1)))))), 12171#(and (or (= csum 0) (< i N)) (or (not (= l k)) (< i N)) (or (< (+ 2 l) N) (= (+ (- 1) N) k) (< i N)) (or (< i N) (<= (+ (select C l) (select A k) (select B k)) (+ asum bsum))) (or (<= (+ 2 l) N) (< i N)) (or (<= (+ asum bsum) (+ (select C l) (select A k) (select B k))) (< i N))), 12144#(and (or (< k N) (< i N) (< csum (+ asum bsum 1))) (or (< k N) (<= (+ asum bsum) csum) (< i N))), 12155#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ (select A i) asum bsum (select B i) 1)) (< (+ i 1) N) (not (< i N))) (or (< (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum)))), 12167#(and (or (< (+ (select C l) csum) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N) (< k N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum)))), 12177#(and (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ (select C l) csum (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum (select A k) (select B k))))), 12174#(and (or (< (+ 2 l) N) (< i N) (= (+ 2 k) N)) (or (= csum 0) (< i N)) (or (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< i N)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (= l k) (< i N))), 12139#(and (or (< k N) (<= (+ asum bsum) csum)) (or (< k N) (< csum (+ asum bsum 1)))), 12157#(and (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< k N)) (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< k N))), 12136#(and (or (<= (+ asum bsum) csum) (< l N) (< i N)) (or (< l N) (< i N) (< csum (+ asum bsum 1)))), 12181#(and (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ 2 k) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (< (+ 2 k) N) (<= (+ 3 l) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= csum 0))), 12170#(and (or (not (< k N)) (< (+ 2 l) N) (<= (+ asum bsum) (+ (select C l) csum (select A k) (select B k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ (select C l) csum (select A k) (select B k)) (+ asum bsum 1)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (<= (+ 2 l) N) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ 2 l) N) (= csum 0) (< (+ k 1) N) (< i N))), 12172#(and (or (not (< (+ k 1) N)) (<= (+ 2 l) N) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< (+ 2 k) N) (<= (+ 3 l) N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))))), 12162#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< l N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< l N))), 12152#(and (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< (+ l 1) N)) (<= (+ 3 l) N)) (or (<= N (+ l 1)) (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< (+ 2 k) N) (<= (+ 3 l) N))), 12138#(and (or (< (+ 2 l) N) (<= (+ (select C l) (select C (+ (- 1) N))) (+ asum bsum)) (< i N)) (or (< (+ 2 l) N) (<= (+ asum bsum) (+ (select C l) csum (select C (+ l 1)))) (< i N)) (or (<= (+ 2 l) N) (< i N)) (or (< (+ 2 l) N) (= csum 0) (< i N))), 12166#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< l N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< k N) (< l N))), 12180#(and (or (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (< (+ i 1) N) (not (< i N))) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= (+ 2 k) N)) (or (= l k) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))))), 12151#(and (or (not (< k N)) (not (< (+ l 1) N)) (<= (+ asum bsum) (+ (select C l) csum (select A k) (select B k))) (<= (+ 3 l) N) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) (select B k)) (+ asum bsum)) (<= N (+ l 1)) (<= (+ 3 l) N) (< (+ k 1) N))), 12173#(and (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (not (< (+ k 1) N)) (<= (+ 2 l) N) (< (+ 2 k) N) (< i N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0) (< i N)) (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< (+ 2 k) N) (<= (+ 3 l) N) (< i N))), 12163#(and (or (< (+ (select C l) csum) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (< (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum)))), 12153#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)))), 12135#(and (or (< i N) (< csum (+ asum bsum 1))) (or (<= (+ asum bsum) csum) (< i N))), 12159#(and (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< k N) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum))) (or (< (+ l 1) N) (< (+ (select C l) csum) (+ (select A i) asum bsum (select B i) 1)) (< (+ i 1) N) (not (< i N)) (< k N))), 12158#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< k N) (< l N)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< k N) (< l N))), 12179#(and (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A i) asum bsum (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)))) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= csum 0)) (or (not (< (+ k 1) N)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< (+ i 1) N) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (not (< i N)) (< (+ 2 k) N) (<= (+ 3 l) N))), 12146#(and (or (< (+ l 1) N) (< k N) (< i N) (< (+ (select C l) csum) (+ asum bsum 1))) (or (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< k N) (< i N))), 12143#(and (or (<= (+ 2 l) N) (< k N) (<= N l) (<= (+ (select C l) csum) (+ asum bsum))) (or (not (< l N)) (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< k N))), 12150#(and (or (< (+ 2 l) N) (< k N) (<= (+ asum bsum) (+ (select C l) csum (select C (+ l 1)))) (< i N)) (or (< (+ 2 l) N) (< (+ (select C l) csum (select C (+ l 1))) (+ asum bsum 1)) (< k N) (< i N)) (or (<= (+ 2 l) N) (< k N) (< i N)) (or (< (+ 2 l) N) (< k N) (= csum 0) (< i N))), 12137#(and (or (< (+ l 1) N) (<= (+ asum bsum) (+ (select C l) csum)) (< i N)) (or (< (+ l 1) N) (< i N) (< (+ (select C l) csum) (+ asum bsum 1)))), 12161#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)))), 12176#(and (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= (+ (- 1) N) k)) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (not (= l k))) (or (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) (select A k) (select B k))) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))))), 12145#(and (or (<= (+ l 1) N) (< k N) (<= (+ asum bsum) csum) (< i N)) (or (<= (+ l 1) N) (< k N) (< i N) (< csum (+ asum bsum 1)))), 12165#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< k N))), 12164#(and (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1))))) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0))), 12182#(and (or (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ 2 k) N)) (or (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))))), 12149#(and (or (< (+ 2 l) N) (< k N) (<= (+ asum bsum) (+ (select C l) (select C (+ (- 1) N))))) (or (< (+ 2 l) N) (< k N) (= csum 0)) (or (<= (+ (select C l) csum (select C (+ l 1))) (+ asum bsum)) (< k N) (<= (+ 3 l) N)) (or (<= (+ 2 l) N) (< k N))), 12168#(and (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< k N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ 2 i) N) (< k N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (= csum 0))), 12175#(and (or (not (< k N)) (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (< (+ (select C l) csum (select A k) (select B k)) (+ (select A i) asum bsum (select B i) 1))) (or (not (< k N)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum (select A k) (select B k))) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= csum 0) (< (+ k 1) N)))] [2022-03-15 21:45:18,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 21:45:18,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:18,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 21:45:18,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=4303, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:45:18,054 INFO L87 Difference]: Start difference. First operand 625 states and 2355 transitions. Second operand has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 57 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:15,274 INFO L93 Difference]: Finished difference Result 3141 states and 10339 transitions. [2022-03-15 21:47:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 448 states. [2022-03-15 21:47:15,274 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 57 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:47:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:15,286 INFO L225 Difference]: With dead ends: 3141 [2022-03-15 21:47:15,286 INFO L226 Difference]: Without dead ends: 3075 [2022-03-15 21:47:15,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 39 SyntacticMatches, 17 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108287 ImplicationChecksByTransitivity, 116.0s TimeCoverageRelationStatistics Valid=30762, Invalid=222750, Unknown=0, NotChecked=0, Total=253512 [2022-03-15 21:47:15,303 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2041 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 4718 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 4718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:15,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2041 Valid, 0 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 4718 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 21:47:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-03-15 21:47:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 972. [2022-03-15 21:47:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.838311019567456) internal successors, (3727), 971 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3727 transitions. [2022-03-15 21:47:15,333 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3727 transitions. Word has length 19 [2022-03-15 21:47:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:15,333 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 3727 transitions. [2022-03-15 21:47:15,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 57 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3727 transitions. [2022-03-15 21:47:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:47:15,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:15,336 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:15,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:15,551 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,SelfDestructingSolverStorable11 [2022-03-15 21:47:15,552 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -807828542, now seen corresponding path program 10 times [2022-03-15 21:47:15,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:15,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256532323] [2022-03-15 21:47:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:47:15,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:15,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256532323] [2022-03-15 21:47:15,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256532323] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:15,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17013644] [2022-03-15 21:47:15,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:15,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:15,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:15,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:15,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:47:15,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:15,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:15,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:47:15,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:47:15,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:47:15,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17013644] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:15,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:47:15,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-03-15 21:47:15,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998847248] [2022-03-15 21:47:15,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:15,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:15,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 138 transitions. [2022-03-15 21:47:15,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:15,924 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:15,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:47:15,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:15,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:47:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:47:15,925 INFO L87 Difference]: Start difference. First operand 972 states and 3727 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:15,967 INFO L93 Difference]: Finished difference Result 953 states and 3464 transitions. [2022-03-15 21:47:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:47:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:47:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:15,971 INFO L225 Difference]: With dead ends: 953 [2022-03-15 21:47:15,971 INFO L226 Difference]: Without dead ends: 918 [2022-03-15 21:47:15,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:47:15,972 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:15,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-03-15 21:47:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 854. [2022-03-15 21:47:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 3.7327080890973034) internal successors, (3184), 853 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 3184 transitions. [2022-03-15 21:47:15,988 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 3184 transitions. Word has length 19 [2022-03-15 21:47:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:15,988 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 3184 transitions. [2022-03-15 21:47:15,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 3184 transitions. [2022-03-15 21:47:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:47:15,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:15,991 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:16,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:16,207 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,SelfDestructingSolverStorable12 [2022-03-15 21:47:16,207 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 681576454, now seen corresponding path program 11 times [2022-03-15 21:47:16,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:16,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111267566] [2022-03-15 21:47:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:16,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:16,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111267566] [2022-03-15 21:47:16,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111267566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:16,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865887714] [2022-03-15 21:47:16,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:16,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:16,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:47:16,474 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:47:16,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:16,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 21:47:16,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:16,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 21:47:16,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-03-15 21:47:16,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-03-15 21:47:16,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:16,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-15 21:47:16,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-03-15 21:47:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:16,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:16,824 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:47:16,825 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 534 treesize of output 502 [2022-03-15 21:47:16,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:16,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:16,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:16,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:16,938 INFO L353 Elim1Store]: treesize reduction 14, result has 72.5 percent of original size [2022-03-15 21:47:16,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 64 [2022-03-15 21:47:16,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:16,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:16,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:16,956 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 27 treesize of output 56 [2022-03-15 21:47:17,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:17,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:17,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:17,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-03-15 21:47:17,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:17,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:17,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:17,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 5 [2022-03-15 21:47:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:17,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865887714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:17,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:17,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-03-15 21:47:17,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2142767383] [2022-03-15 21:47:17,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:17,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:17,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 154 transitions. [2022-03-15 21:47:17,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:22,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [21034#(and (or (<= (+ (select A i) asum bsum (select B i)) (+ (select A (+ k 1)) (select C l) (select B (+ k 1)))) (not (< k N)) (<= (+ 3 k) N) (= l k) (< (+ i 1) N) (not (< i N))) (or (not (< k N)) (<= (+ 3 k) N) (= l k) (<= (+ (select A (+ k 1)) (select C l) (select B (+ k 1))) (+ (select A i) asum bsum (select B i))) (< (+ i 1) N) (not (< i N))) (or (not (< k N)) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (not (= l k)) (<= (+ (select A i) asum bsum (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)))) (or (not (< k N)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (not (< k N)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (< (+ i 1) N) (not (< i N)) (not (= l k))) (or (not (< k N)) (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (= csum 0))), 21007#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< l N)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< l N))), 20999#(and (or (<= (+ asum bsum) csum) (< l N) (< i N)) (or (< l N) (< i N) (< csum (+ asum bsum 1)))), 20995#(and (or (< k N) (<= (+ asum bsum) csum)) (or (< k N) (< csum (+ asum bsum 1)))), 20996#(and (or (< i N) (< csum (+ asum bsum 1))) (or (<= (+ asum bsum) csum) (< i N))), 21026#(and (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 3 l) N)) (or (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 l) N)) (or (<= (+ (select C l) csum (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 l) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 l) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum (select A k) (select B k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 l) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) (select A k) (select B k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ l 1) k) (<= (+ 3 l) N))), 21016#(and (or (not (< k N)) (<= (+ asum bsum) (+ (select C l) csum (select A k) (select B k))) (<= (+ 3 l) N) (<= k l)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) (select B k)) (+ asum bsum)) (<= (+ 3 l) N) (<= k l))), 21037#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= (+ 2 k) N)) (or (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))))), 21024#(and (or (= (+ (* (- 1) k) p) 0) (< i N)) (or (<= (+ p 1) N) (< i N)) (or (<= (+ 2 p) N) (< i N) (<= (+ (select C l) (select A k) (select B k)) (+ asum bsum))) (or (<= (+ 2 p) N) (= csum 0) (< i N)) (or (<= (+ 2 p) N) (<= (+ asum bsum) (+ (select C l) (select A k) (select B k))) (< i N))), 21033#(and (or (= l k) (< (+ 2 k) N) (< i N)) (or (<= (+ 3 k) N) (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))) (< i N)) (or (< (+ 2 k) N) (< i N) (= (+ 2 k) N)) (or (<= (+ 3 k) N) (= csum 0) (< i N)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (< i N))), 21032#(and (or (not (< k N)) (<= (+ 3 k) N) (and (not (= l k)) (<= (+ (select A (+ k 1)) (select C l) (select B (+ k 1))) (+ asum bsum))) (and (= l k) (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum))) (< i N)) (or (and (<= (+ asum bsum) (+ (select A (+ k 1)) (select C l) (select B (+ k 1)))) (not (= l k))) (not (< k N)) (<= (+ 3 k) N) (and (= l k) (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)))) (< i N)) (or (not (< k N)) (<= (+ 3 k) N) (= csum 0) (< i N)) (or (not (< k N)) (<= (+ 2 k) N) (< i N))), 21000#(and (or (<= (+ l 1) N) (< k N) (<= (+ asum bsum) csum) (< i N)) (or (<= (+ l 1) N) (< k N) (< i N) (< csum (+ asum bsum 1)))), 21013#(and (or (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< k N)) (or (<= (+ 2 l) N) (< k N) (<= (+ (select C l) csum) (+ asum bsum)))), 21022#(and (or (< k (+ l 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N)) (or (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ csum (select A k) (select B k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= l k) (<= (+ 2 l) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (<= (+ csum (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))))), 21003#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)))), 21019#(and (or (not (< l N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< l p)) (<= (+ 2 l) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum))) (or (not (< l N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< l p)) (<= (+ 2 l) N) (<= (+ (select C l) csum) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))))), 21036#(and (or (<= (+ 3 k) N) (<= N i) (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (<= N i) (< (+ i 1) N)) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (= l k) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N)) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= (+ 2 k) N))), 21006#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< k N))), 21001#(and (or (< (+ l 1) N) (<= (+ asum bsum) (+ (select C l) csum)) (< i N)) (or (< (+ l 1) N) (< i N) (< (+ (select C l) csum) (+ asum bsum 1)))), 20998#(and (or (<= (+ l 1) N) (< k N) (< csum (+ asum bsum 1))) (or (<= (+ l 1) N) (< k N) (<= (+ asum bsum) csum))), 21012#(and (or (< (+ (select C l) csum) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (< (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) csum)))), 21023#(and (or (<= (+ 3 l) N) (<= (+ asum bsum) (+ (select C l) (select A k) (select B k))) (< i N)) (or (<= (+ l 1) k) (<= (+ 3 l) N) (< i N)) (or (<= (+ k 1) N) (<= (+ 3 l) N) (< i N)) (or (<= (+ 3 l) N) (< i N) (<= (+ (select C l) (select A k) (select B k)) (+ asum bsum))) (or (<= (+ (select C l) csum (select A k) (select B k)) (+ asum bsum)) (<= (+ 3 l) N) (< i N)) (or (<= (+ asum bsum) (+ (select C l) csum (select A k) (select B k))) (<= (+ 3 l) N) (< i N))), 21011#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ (select A i) asum bsum (select B i) 1)) (< (+ i 1) N) (not (< i N))) (or (< (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum)))), 21021#(and (or (< (+ i 1) N) (<= l k) (<= (+ 2 l) N) (not (< i N))) (or (< k (+ l 1)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (<= (+ csum (select A k) (select B k)) (+ (select A i) asum bsum (select B i)))) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ csum (select A k) (select B k))))), 21018#(and (or (<= (+ (select C l) csum) (+ (select A i) asum bsum (select B i))) (not (< l N)) (< (+ i 1) N) (not (< l p)) (<= (+ 2 l) N) (not (< i N))) (or (not (< l N)) (< (+ i 1) N) (not (< l p)) (<= (+ 2 l) N) (not (< i N)) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum)))), 21031#(and (or (<= (+ 2 k) N) (<= N k)) (or (and (<= (+ asum bsum) (+ (select A (+ k 1)) (select C l) (select B (+ k 1)))) (not (= l k))) (not (< k N)) (<= (+ 3 k) N) (and (= l k) (<= (+ asum bsum) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))))) (or (not (< k N)) (<= (+ 3 k) N) (and (not (= l k)) (<= (+ (select A (+ k 1)) (select C l) (select B (+ k 1))) (+ asum bsum))) (and (= l k) (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)))) (or (not (< k N)) (<= (+ 3 k) N) (= csum 0))), 21020#(and (or (< k (+ l 1)) (<= (+ 2 l) N) (< i N)) (or (<= (+ 2 l) N) (< i N) (<= (+ csum (select A k) (select B k)) (+ asum bsum))) (or (<= l k) (<= (+ 2 l) N) (< i N)) (or (<= (+ 2 l) N) (< i N) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 21005#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)))), 21009#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< l N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< l N))), 21004#(and (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< k N)) (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< k N))), 21015#(and (or (not (< k N)) (<= (+ 2 l) N) (<= (+ k 1) l) (<= (+ csum (select A k) (select B k)) (+ asum bsum))) (or (not (< k N)) (<= (+ 2 l) N) (<= (+ k 1) l) (<= (+ asum bsum) (+ csum (select A k) (select B k))))), 21025#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (<= (+ 3 l) N)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 3 l) N)) (or (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) (select A k) (select B k))) (< (+ i 1) N) (not (< i N)) (<= (+ 3 l) N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) csum (select A k) (select B k)) (+ (select A i) asum bsum (select B i))) (<= (+ 3 l) N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ l 1) k) (<= (+ 3 l) N)) (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) csum (select A k) (select B k))) (not (< i N)) (<= (+ 3 l) N))), 21002#(and (or (not (< l N)) (not (< l p)) (<= (+ 2 l) N) (<= (+ (select C l) csum) (+ asum bsum))) (or (not (< l N)) (not (< l p)) (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N))), 20997#(and (or (< k N) (< i N) (< csum (+ asum bsum 1))) (or (< k N) (<= (+ asum bsum) csum) (< i N))), 21014#(and (or (not (< l N)) (not (< l p)) (<= (+ 2 l) N) (< k N) (<= (+ (select C l) csum) (+ asum bsum))) (or (not (< l N)) (not (< l p)) (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< k N))), 21029#(and (or (not (< k N)) (<= (+ asum bsum) (+ (select C l) csum (select A k) (select B k))) (<= (+ 3 l) N) (<= p l) (<= k l)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) (select B k)) (+ asum bsum)) (<= (+ 3 l) N) (<= p l) (<= k l))), 21030#(and (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k)) (+ asum bsum)) (<= (+ 3 l) N) (<= (+ k 1) l)) (or (<= (+ asum bsum) (+ (select A (+ k 1)) csum (select B (+ k 1)) (select A k) (select B k))) (not (< (+ k 1) N)) (<= (+ 3 l) N) (<= (+ k 1) l))), 21027#(and (or (<= (+ 2 p) N) (<= (+ (select A i) asum bsum (select B i)) (+ (select C l) (select A k) (select B k))) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) k) p) 0)) (or (<= (+ 2 p) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) asum bsum (select B i)))) (or (< (+ i 1) N) (not (< i N)) (<= (+ p 1) N)) (or (<= (+ 2 p) N) (< (+ i 1) N) (not (< i N)) (= csum 0))), 21017#(and (or (not (< l N)) (not (< l p)) (<= (+ 2 l) N) (<= (+ (select C l) csum) (+ asum bsum)) (< i N)) (or (not (< l N)) (not (< l p)) (<= (+ asum bsum) (+ (select C l) csum)) (<= (+ 2 l) N) (< i N))), 21028#(and (or (<= (+ 2 p) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select C l) (select A k) (select B k)))) (or (<= (+ 2 p) N) (<= (+ (select C l) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ (* (- 1) k) p) 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ p 1) N)) (or (<= (+ 2 p) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0))), 21010#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< csum (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)) 1)) (< l N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) csum) (< k N) (< l N))), 21008#(and (or (< (+ i 1) N) (<= (+ (select A i) asum bsum (select B i)) csum) (not (< i N)) (< k N) (< l N)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) asum bsum (select B i) 1)) (< k N) (< l N))), 21035#(and (or (not (< k N)) (<= (+ 3 k) N) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) (select B (+ k 1))))) (or (not (< k N)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< k N)) (<= (+ 3 k) N) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) (select C l) (select B (+ k 1))) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (not (< k N)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k))) (not (= l k))) (or (<= (+ (select A (+ k 1)) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) asum bsum (select B i) (select A (+ i 1)))) (not (< k N)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= l k))))] [2022-03-15 21:47:22,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 21:47:22,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 21:47:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3850, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:47:22,382 INFO L87 Difference]: Start difference. First operand 854 states and 3184 transitions. Second operand has 54 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:48,106 INFO L93 Difference]: Finished difference Result 4454 states and 13424 transitions. [2022-03-15 21:49:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 514 states. [2022-03-15 21:49:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:49:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:48,123 INFO L225 Difference]: With dead ends: 4454 [2022-03-15 21:49:48,123 INFO L226 Difference]: Without dead ends: 4276 [2022-03-15 21:49:48,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140101 ImplicationChecksByTransitivity, 142.5s TimeCoverageRelationStatistics Valid=32718, Invalid=291612, Unknown=0, NotChecked=0, Total=324330 [2022-03-15 21:49:48,164 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2645 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5905 mSolverCounterSat, 1191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1191 IncrementalHoareTripleChecker+Valid, 5905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:48,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2645 Valid, 0 Invalid, 7096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1191 Valid, 5905 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 21:49:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2022-03-15 21:49:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 958. [2022-03-15 21:49:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 3.741901776384535) internal successors, (3581), 957 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 3581 transitions. [2022-03-15 21:49:48,199 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 3581 transitions. Word has length 19 [2022-03-15 21:49:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:48,199 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 3581 transitions. [2022-03-15 21:49:48,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 3581 transitions. [2022-03-15 21:49:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:49:48,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:48,202 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:48,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:48,418 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,SelfDestructingSolverStorable13 [2022-03-15 21:49:48,418 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 915378591, now seen corresponding path program 12 times [2022-03-15 21:49:48,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:48,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366556445] [2022-03-15 21:49:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:48,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:48,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366556445] [2022-03-15 21:49:48,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366556445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:48,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767188369] [2022-03-15 21:49:48,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:49:48,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:48,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:48,478 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:49:48,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:49:48,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:48,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:49:48,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:49:48,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:49:48,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767188369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:48,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:48,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 16 [2022-03-15 21:49:48,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2089634271] [2022-03-15 21:49:48,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:48,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:48,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 218 transitions. [2022-03-15 21:49:48,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:50,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [28544#(or (<= (+ 3 N) i) (< k N)), 28546#(or (<= (+ 3 N) i) (< k N) (< l N)), 28564#(or (<= N (+ k 1)) (< (+ l 1) N) (<= (+ 3 N) i) (< (+ 2 k) N) (<= N l)), 28512#(< l N), 28569#(or (<= (+ N 1) i) (< k N)), 28563#(or (<= N (+ k 1)) (< (+ l 1) N) (< (+ 2 k) N) (<= N l)), 28558#(or (< (+ l 1) N) (not (< l N)) (<= (+ 2 N) i)), 28561#(or (< (+ l 1) N) (<= (+ 3 N) i) (<= N k) (< (+ k 1) N) (<= N l)), 28555#(or (< (+ l 1) N) (< k N) (<= N l)), 28542#(or (< (+ l 1) N) (<= (+ 3 N) i)), 28556#(or (< (+ l 1) N) (not (< l N)) (<= (+ 3 N) i)), 28570#(or (<= (+ (* 2 l) 1) (+ N i)) (< k N)), 28552#(or (< (+ l 1) N) (<= (+ 2 N) i)), 28549#(or (<= (+ 2 N) i) (< l N)), 28565#(or (<= N (+ k 1)) (< (+ l 1) N) (< (+ 2 k) N) (<= (+ 2 N) i) (<= N l)), 28541#(or (<= (+ 3 N) i) (< l N)), 28547#(or (< (+ l 1) N) (< k N)), 28553#(or (< (+ l 1) N) (< k N) (<= (+ 2 N) i)), 28559#(or (< (+ l 1) N) (not (< l N)) (< k N) (<= (+ 2 N) i)), 28560#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N) (<= N l)), 28557#(or (< (+ l 1) N) (not (< l N)) (<= (+ 3 N) i) (< k N)), 28566#(or (< (+ l 1) N) (<= N (+ 2 k)) (<= N l) (< (+ 3 k) N)), 28574#(and (or (= (+ l (* (- 1) i)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 l) N) (<= N (+ 2 k)) (< (+ 3 k) N))), 28460#(< (+ l 1) N), 28562#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N) (<= (+ 2 N) i) (<= N l)), 28551#(or (< k N) (<= (+ 2 N) i) (< l N)), 28550#(or (< k N) (<= (+ 2 N) i)), 28571#(and (or (< k N) (<= (+ 3 l) N)) (or (< k N) (= (+ l (* (- 1) i)) 0))), 28572#(and (or (<= N k) (= (+ l (* (- 1) i)) 0) (< (+ k 1) N)) (or (<= N k) (<= (+ 3 l) N) (< (+ k 1) N))), 28545#(or (< k N) (< l N)), 28573#(and (or (<= N (+ k 1)) (< (+ 2 k) N) (= (+ l (* (- 1) i)) 0)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 3 l) N))), 28543#(< k N), 28554#(or (< (+ l 1) N) (<= N l)), 28548#(or (< (+ l 1) N) (<= (+ 3 N) i) (< k N)), 28567#(or (< (+ l 1) N) (<= (+ 3 N) i) (<= N (+ 2 k)) (<= N l) (< (+ 3 k) N)), 28568#(or (< (+ l 1) N) (<= N (+ 2 k)) (<= (+ 2 N) i) (<= N l) (< (+ 3 k) N))] [2022-03-15 21:49:50,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:49:50,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:50,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:49:50,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=2115, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:49:50,505 INFO L87 Difference]: Start difference. First operand 958 states and 3581 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 45 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:51,867 INFO L93 Difference]: Finished difference Result 2048 states and 6820 transitions. [2022-03-15 21:49:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:49:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 45 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:49:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:51,875 INFO L225 Difference]: With dead ends: 2048 [2022-03-15 21:49:51,875 INFO L226 Difference]: Without dead ends: 2048 [2022-03-15 21:49:51,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1372, Invalid=5434, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:49:51,876 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 509 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:51,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 0 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-03-15 21:49:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1009. [2022-03-15 21:49:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.7192460317460316) internal successors, (3749), 1008 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3749 transitions. [2022-03-15 21:49:51,898 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3749 transitions. Word has length 19 [2022-03-15 21:49:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:51,899 INFO L470 AbstractCegarLoop]: Abstraction has 1009 states and 3749 transitions. [2022-03-15 21:49:51,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 45 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3749 transitions. [2022-03-15 21:49:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:49:51,901 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:51,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:51,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:52,119 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,SelfDestructingSolverStorable14 [2022-03-15 21:49:52,119 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1466599595, now seen corresponding path program 13 times [2022-03-15 21:49:52,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:52,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949478610] [2022-03-15 21:49:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:52,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:52,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949478610] [2022-03-15 21:49:52,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949478610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:52,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661792537] [2022-03-15 21:49:52,175 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:49:52,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:52,176 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:52,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:49:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:52,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:49:52,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:49:52,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:49:52,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661792537] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:52,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:52,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 13 [2022-03-15 21:49:52,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470950163] [2022-03-15 21:49:52,275 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:52,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:52,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 172 transitions. [2022-03-15 21:49:52,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:53,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [32851#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 N) i) (< l N)), 32831#(or (< k N) (< l N)), 32837#(or (<= N (+ k 1)) (< (+ l 1) N) (< (+ 2 k) N)), 32844#(or (< k N) (<= (+ 2 N) i) (< l N)), 32856#(or (<= (* 2 N) (+ k i)) (< l N)), 32843#(or (<= N k) (< (+ k 1) N) (<= (+ 2 N) i)), 32827#(< l N), 32854#(or (<= (+ N 1) i) (< l N)), 32836#(or (<= N (+ k 1)) (< (+ 2 k) N) (< l N)), 32833#(or (<= N k) (< (+ k 1) N)), 32847#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 N) i)), 32852#(or (<= N (+ k 1)) (< (+ l 1) N) (< (+ 2 k) N) (<= (+ 2 N) i)), 32848#(or (<= N (+ k 1)) (<= (+ 3 N) i) (< (+ 2 k) N) (< l N)), 32828#(or (<= (+ 3 N) i) (< l N)), 32841#(or (<= (+ 3 N) i) (<= N k) (< (+ k 1) N) (< l N)), 32849#(or (<= N (+ k 1)) (< (+ l 1) N) (<= (+ 3 N) i) (< (+ 2 k) N)), 32829#(< k N), 32839#(or (<= (+ 2 N) i) (< l N)), 32853#(or (<= N (+ k 1)) (< (+ l 1) N) (not (< l N)) (not (< l p)) (< (+ 2 k) N) (<= (+ 2 N) i)), 32832#(or (<= (+ 3 N) i) (< k N) (< l N)), 32845#(or (<= N k) (< (+ k 1) N) (<= (+ 2 N) i) (< l N)), 32855#(or (<= N k) (= l i)), 32835#(or (<= N (+ k 1)) (< (+ 2 k) N)), 32840#(or (<= (+ 3 N) i) (<= N k) (< (+ k 1) N)), 32834#(or (<= N k) (< (+ k 1) N) (< l N)), 32850#(or (<= N (+ k 1)) (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= (+ 3 N) i) (< (+ 2 k) N)), 32846#(or (<= N (+ k 1)) (<= (+ 3 N) i) (< (+ 2 k) N)), 32830#(or (<= (+ 3 N) i) (< k N)), 32842#(or (< k N) (<= (+ 2 N) i)), 32838#(or (<= N (+ k 1)) (< (+ l 1) N) (not (< l N)) (not (< l p)) (< (+ 2 k) N))] [2022-03-15 21:49:53,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:49:53,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:49:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:49:53,548 INFO L87 Difference]: Start difference. First operand 1009 states and 3749 transitions. Second operand has 41 states, 41 states have (on average 2.951219512195122) internal successors, (121), 41 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:55,148 INFO L93 Difference]: Finished difference Result 1958 states and 6858 transitions. [2022-03-15 21:49:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:49:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.951219512195122) internal successors, (121), 41 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:49:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:55,154 INFO L225 Difference]: With dead ends: 1958 [2022-03-15 21:49:55,154 INFO L226 Difference]: Without dead ends: 1936 [2022-03-15 21:49:55,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1787, Invalid=6403, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:49:55,155 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 508 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:55,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 0 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-03-15 21:49:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1125. [2022-03-15 21:49:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 3.807829181494662) internal successors, (4280), 1124 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 4280 transitions. [2022-03-15 21:49:55,205 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 4280 transitions. Word has length 19 [2022-03-15 21:49:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:55,205 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 4280 transitions. [2022-03-15 21:49:55,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.951219512195122) internal successors, (121), 41 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 4280 transitions. [2022-03-15 21:49:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:55,208 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:55,208 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:55,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:55,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:55,408 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -281392545, now seen corresponding path program 14 times [2022-03-15 21:49:55,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:55,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987420179] [2022-03-15 21:49:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:49:55,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:55,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987420179] [2022-03-15 21:49:55,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987420179] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:55,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585164313] [2022-03-15 21:49:55,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:49:55,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:55,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:55,448 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:55,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:49:55,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:49:55,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:55,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:49:55,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:49:55,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:49:55,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585164313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:55,540 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:55,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:49:55,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097684492] [2022-03-15 21:49:55,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:55,542 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:55,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 119 states and 253 transitions. [2022-03-15 21:49:55,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:56,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [37330#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 37319#(or (<= N k) (< (+ k 1) N) (< i N)), 37316#(or (<= N (+ k 1)) (< (+ 2 k) N)), 37332#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 37325#(or (<= N i) (< k N)), 37315#(or (<= N k) (< (+ k 1) N)), 37333#(or (<= N (+ i 1)) (< k N)), 37337#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N) (< (+ 3 i) N)), 37322#(or (<= N i) (< (+ i 1) N) (< k N)), 37324#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 37320#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 37314#(< k N), 37338#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 37317#(< i N), 37318#(or (< k N) (< i N)), 37329#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 37321#(or (<= N i) (< (+ i 1) N)), 37331#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 37334#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 37327#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 37336#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 37326#(or (<= N i) (<= N k) (< (+ k 1) N)), 37323#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 37328#(or (<= N (+ i 1)) (< (+ 2 i) N)), 37335#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N))] [2022-03-15 21:49:56,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:49:56,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:49:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:49:56,591 INFO L87 Difference]: Start difference. First operand 1125 states and 4280 transitions. Second operand has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 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 21:49:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:58,766 INFO L93 Difference]: Finished difference Result 4728 states and 17877 transitions. [2022-03-15 21:49:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 21:49:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 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 20 [2022-03-15 21:49:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:58,781 INFO L225 Difference]: With dead ends: 4728 [2022-03-15 21:49:58,781 INFO L226 Difference]: Without dead ends: 4677 [2022-03-15 21:49:58,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2232, Invalid=8480, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 21:49:58,783 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 943 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:58,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [943 Valid, 0 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:49:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2022-03-15 21:49:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 2845. [2022-03-15 21:49:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2844 states have (on average 4.254922644163151) internal successors, (12101), 2844 states have internal predecessors, (12101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 12101 transitions. [2022-03-15 21:49:58,865 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 12101 transitions. Word has length 20 [2022-03-15 21:49:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:58,865 INFO L470 AbstractCegarLoop]: Abstraction has 2845 states and 12101 transitions. [2022-03-15 21:49:58,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 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 21:49:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 12101 transitions. [2022-03-15 21:49:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:58,877 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:58,877 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:58,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:59,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:49:59,094 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:59,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1408644378, now seen corresponding path program 15 times [2022-03-15 21:49:59,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:59,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517763641] [2022-03-15 21:49:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:59,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:59,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517763641] [2022-03-15 21:49:59,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517763641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:59,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138996463] [2022-03-15 21:49:59,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:59,166 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:59,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:49:59,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:49:59,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:59,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:49:59,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 21:49:59,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 21:49:59,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138996463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:59,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:59,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-03-15 21:49:59,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922558078] [2022-03-15 21:49:59,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:59,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:59,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 200 transitions. [2022-03-15 21:49:59,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:01,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 51 new interpolants: [48036#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< l N)), 48054#(or (<= (+ (* 2 l) 1) (+ k i)) (<= N k) (<= (+ k 1) l)), 48067#(or (<= N (+ 2 i)) (<= (+ 3 N) k) (< (+ 3 i) N)), 48047#(or (not (< l N)) (not (< l p)) (<= (+ (* 2 l) 4) (+ N k))), 48053#(or (<= N k) (<= (+ 2 (* 2 l)) (+ k i)) (<= (+ k 1) l)), 48048#(<= (+ 3 (* 2 l)) (+ k i)), 48056#(or (<= (+ N 4) k) (<= N i) (< (+ i 1) N)), 48031#(or (<= N i) (< (+ i 1) N) (< l N)), 48051#(or (not (< l N)) (not (< l p)) (<= (+ 2 (* 2 l)) (+ k i))), 48052#(or (<= (+ 3 (* 2 l)) (+ N k)) (<= N k) (<= (+ k 1) l)), 48029#(< l N), 48033#(< k N), 48062#(or (<= N (+ i 1)) (<= (+ N 4) k) (< (+ 2 i) N) (< l N)), 48063#(or (<= (+ N 4) k) (<= N (+ 2 i)) (< (+ 3 i) N)), 48066#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 N) k)), 48058#(or (<= (+ 2 N) k) (< i N)), 48055#(or (<= (+ N 4) k) (< i N)), 48065#(or (<= N i) (< (+ i 1) N) (<= (+ 3 N) k)), 48035#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 48050#(<= (+ 2 (* 2 l)) (+ k i)), 48041#(or (<= N (+ k 1)) (< (+ 2 k) N) (< l N)), 48028#(or (<= N (+ i 1)) (< (+ 2 i) N)), 48049#(or (not (< l N)) (not (< l p)) (<= (+ 3 (* 2 l)) (+ k i))), 48042#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 48069#(or (<= (+ 3 N) k) (< l N)), 48073#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 N) k)), 48071#(or (<= N i) (< (+ i 1) N) (<= (+ 3 N) k) (< l N)), 48039#(or (<= (+ N 4) k) (< l N)), 48037#(or (<= N k) (< (+ k 1) N)), 48068#(or (<= N i) (< (+ i 1) N) (<= (+ 2 N) k)), 48064#(or (<= (+ N 4) k) (<= N (+ 2 i)) (< (+ 3 i) N) (< l N)), 48072#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 N) k) (< l N)), 48026#(< i N), 48027#(or (<= N i) (< (+ i 1) N)), 48059#(or (<= (+ N 4) k) (< l N) (< i N)), 48074#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 2 N) k)), 48040#(or (<= N (+ k 1)) (< (+ 2 k) N)), 48060#(or (<= (+ N 4) k) (<= N i) (< (+ i 1) N) (< l N)), 48043#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< l N)), 48032#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 48044#(or (< (+ l 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 48057#(or (<= (+ 3 N) k) (< i N)), 48030#(or (< l N) (< i N)), 48075#(or (<= N (+ 2 i)) (<= (+ 3 N) k) (< (+ 3 i) N) (< l N)), 48038#(or (<= N k) (< (+ k 1) N) (< l N)), 48070#(or (<= (+ 3 N) k) (< l N) (< i N)), 48034#(or (< k N) (< l N)), 48046#(<= (+ (* 2 l) 4) (+ N k)), 48061#(or (<= N (+ i 1)) (<= (+ N 4) k) (< (+ 2 i) N)), 48076#(or (<= N k) (= l i)), 48045#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 21:50:01,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 21:50:01,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 21:50:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=3844, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:50:01,377 INFO L87 Difference]: Start difference. First operand 2845 states and 12101 transitions. Second operand has 63 states, 63 states have (on average 2.6031746031746033) internal successors, (164), 63 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:04,623 INFO L93 Difference]: Finished difference Result 14578 states and 50418 transitions. [2022-03-15 21:51:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1120 states. [2022-03-15 21:51:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.6031746031746033) internal successors, (164), 63 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:51:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:04,667 INFO L225 Difference]: With dead ends: 14578 [2022-03-15 21:51:04,667 INFO L226 Difference]: Without dead ends: 14414 [2022-03-15 21:51:04,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 1174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641925 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=126199, Invalid=1255601, Unknown=0, NotChecked=0, Total=1381800 [2022-03-15 21:51:04,735 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2624 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 8889 mSolverCounterSat, 1630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1630 IncrementalHoareTripleChecker+Valid, 8889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:04,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2624 Valid, 0 Invalid, 10519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1630 Valid, 8889 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 21:51:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14414 states. [2022-03-15 21:51:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14414 to 5037. [2022-03-15 21:51:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 5036 states have (on average 4.334193804606831) internal successors, (21827), 5036 states have internal predecessors, (21827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 21827 transitions. [2022-03-15 21:51:04,932 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 21827 transitions. Word has length 20 [2022-03-15 21:51:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:04,933 INFO L470 AbstractCegarLoop]: Abstraction has 5037 states and 21827 transitions. [2022-03-15 21:51:04,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.6031746031746033) internal successors, (164), 63 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 21827 transitions. [2022-03-15 21:51:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:05,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:05,059 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:05,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:05,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:51:05,287 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 610311842, now seen corresponding path program 16 times [2022-03-15 21:51:05,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:05,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808148530] [2022-03-15 21:51:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:05,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:05,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808148530] [2022-03-15 21:51:05,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808148530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:05,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526917173] [2022-03-15 21:51:05,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:05,347 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:05,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:51:05,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:05,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:05,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:51:05,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:51:05,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:51:05,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526917173] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:05,475 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:05,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-03-15 21:51:05,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694954675] [2022-03-15 21:51:05,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:05,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:05,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 178 transitions. [2022-03-15 21:51:05,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:06,918 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [75225#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 75204#(or (< k N) (< i N)), 75227#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= (+ (* (- 1) k) p) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l)))), 75202#(< i N), 75221#(and (or (<= N i) (< (+ i 1) N) (= (+ (* (- 1) k) p) 0)) (or (<= N i) (< (+ i 1) N) (<= N (+ 2 l)))), 75226#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= (+ (* (- 1) k) p) 0)) (or (<= N (+ i 1)) (<= N (+ l 1)) (< (+ 2 i) N))), 75230#(or (<= N (+ k 1)) (<= N (+ 2 l)) (< i N)), 75232#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l))), 75222#(or (<= N i) (< (+ i 1) N) (<= N k) (<= N (+ 2 l))), 75239#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l))), 75229#(or (<= N (+ k 1)) (<= N (+ 2 l))), 75218#(or (<= N i) (< (+ i 1) N) (< k N)), 75210#(< (+ l 1) N), 75206#(or (< k N) (< l N)), 75211#(or (< (+ l 1) N) (< k N)), 75237#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k)) (<= N (+ 2 l))), 75233#(or (<= N (+ 2 k)) (<= N (+ 2 l))), 75238#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 l))), 75214#(or (< (+ 2 l) N) (<= N k) (not (< (+ l 1) N)) (< (+ k 1) N) (not (< (+ l 1) p))), 75205#(< l N), 75207#(or (<= N k) (< i N)), 75215#(or (<= N k) (<= N (+ 2 l))), 75216#(or (<= N k) (<= N (+ 2 l)) (< i N)), 75220#(and (or (<= N i) (< (+ i 1) N) (= (+ (* (- 1) k) p) 0)) (or (<= N (+ l 1)) (<= N i) (< (+ i 1) N))), 75212#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N)), 75228#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (<= N (+ 2 l))), 75217#(or (<= N i) (< (+ i 1) N)), 75203#(< k N), 75235#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (<= N (+ 2 l))), 75208#(and (or (= (+ (* (- 1) k) p) 0) (< i N)) (or (<= N (+ l 1)) (< i N))), 75231#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (<= N (+ 2 l))), 75213#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= N k) (< (+ k 1) N)), 75234#(or (<= N (+ 2 k)) (<= N (+ 2 l)) (< i N)), 75209#(and (or (= (+ (* (- 1) k) p) 0) (< i N)) (or (<= N (+ 2 l)) (< i N))), 75236#(or (<= N (+ 2 l)) (< i N)), 75224#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 75223#(or (<= N (+ i 1)) (< (+ 2 i) N)), 75219#(or (<= N i) (< (+ i 1) N) (<= N k))] [2022-03-15 21:51:06,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:51:06,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:51:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:51:06,919 INFO L87 Difference]: Start difference. First operand 5037 states and 21827 transitions. Second operand has 47 states, 47 states have (on average 3.0) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:35,907 INFO L93 Difference]: Finished difference Result 28560 states and 120399 transitions. [2022-03-15 21:51:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 567 states. [2022-03-15 21:51:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.0) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 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 21:51:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:36,012 INFO L225 Difference]: With dead ends: 28560 [2022-03-15 21:51:36,012 INFO L226 Difference]: Without dead ends: 28206 [2022-03-15 21:51:36,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165452 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=51362, Invalid=318910, Unknown=0, NotChecked=0, Total=370272 [2022-03-15 21:51:36,028 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1539 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 3825 mSolverCounterSat, 1106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1106 IncrementalHoareTripleChecker+Valid, 3825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:36,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 0 Invalid, 4931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1106 Valid, 3825 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:51:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2022-03-15 21:51:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 13464. [2022-03-15 21:51:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13464 states, 13463 states have (on average 4.753249647181163) internal successors, (63993), 13463 states have internal predecessors, (63993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 63993 transitions. [2022-03-15 21:51:36,611 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 63993 transitions. Word has length 21 [2022-03-15 21:51:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:36,611 INFO L470 AbstractCegarLoop]: Abstraction has 13464 states and 63993 transitions. [2022-03-15 21:51:36,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.0) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 63993 transitions. [2022-03-15 21:51:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:36,646 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:36,646 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:36,662 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 21:51:36,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:36,847 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2099716838, now seen corresponding path program 17 times [2022-03-15 21:51:36,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:36,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279615271] [2022-03-15 21:51:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:36,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:36,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279615271] [2022-03-15 21:51:36,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279615271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:36,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851951333] [2022-03-15 21:51:36,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:36,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:36,888 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 21:51:36,889 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 21:51:36,921 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:51:36,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:36,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:51:36,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:36,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:36,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851951333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:36,988 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:36,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2022-03-15 21:51:36,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963267224] [2022-03-15 21:51:36,989 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:36,990 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:37,002 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 194 transitions. [2022-03-15 21:51:37,002 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:37,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [132129#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 132128#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 132127#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 132119#(or (< (+ k 4) N) (<= N (+ 3 k))), 132131#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 132114#(or (<= N k) (< (+ k 1) N)), 132125#(or (<= N (+ i 1)) (< (+ 2 i) N)), 132121#(or (<= N i) (< (+ i 1) N)), 132116#(or (<= N k) (< i N)), 132132#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 132123#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 132112#(or (< k N) (< i N)), 132117#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 132118#(or (<= N (+ k 1)) (< i N)), 132124#(or (<= N i) (< (+ i 1) N) (<= N k)), 132115#(or (<= N (+ k 1)) (< (+ 2 k) N)), 132126#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 132111#(< k N), 132120#(or (<= N (+ 2 k)) (< i N)), 132130#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 132113#(or (<= (+ N 1) k) (< i N)), 132122#(or (<= N i) (< (+ i 1) N) (< k N)), 132110#(< i N)] [2022-03-15 21:51:37,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:51:37,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:51:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:51:37,829 INFO L87 Difference]: Start difference. First operand 13464 states and 63993 transitions. Second operand has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 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 21:51:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:39,582 INFO L93 Difference]: Finished difference Result 53725 states and 242078 transitions. [2022-03-15 21:51:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:51:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 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 21 [2022-03-15 21:51:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:39,816 INFO L225 Difference]: With dead ends: 53725 [2022-03-15 21:51:39,817 INFO L226 Difference]: Without dead ends: 53603 [2022-03-15 21:51:39,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1419, Invalid=5061, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:51:39,817 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 601 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:39,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 0 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:51:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53603 states. [2022-03-15 21:51:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53603 to 25465. [2022-03-15 21:51:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25465 states, 25464 states have (on average 4.794494187873076) internal successors, (122087), 25464 states have internal predecessors, (122087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25465 states to 25465 states and 122087 transitions. [2022-03-15 21:51:41,066 INFO L78 Accepts]: Start accepts. Automaton has 25465 states and 122087 transitions. Word has length 21 [2022-03-15 21:51:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:41,066 INFO L470 AbstractCegarLoop]: Abstraction has 25465 states and 122087 transitions. [2022-03-15 21:51:41,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 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 21:51:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25465 states and 122087 transitions. [2022-03-15 21:51:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:41,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:41,141 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:41,158 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 21:51:41,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:41,347 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash 767667213, now seen corresponding path program 18 times [2022-03-15 21:51:41,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:41,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540627179] [2022-03-15 21:51:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:41,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:41,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540627179] [2022-03-15 21:51:41,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540627179] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:41,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751011624] [2022-03-15 21:51:41,398 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:51:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:41,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:41,399 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 21:51:41,401 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 21:51:41,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:51:41,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:41,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:51:41,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:41,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:51:41,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751011624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:41,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:41,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-03-15 21:51:41,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221204341] [2022-03-15 21:51:41,515 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:41,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:41,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 258 transitions. [2022-03-15 21:51:41,531 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:42,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [237029#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l))), 237015#(or (<= N i) (< (+ i 1) N)), 237021#(or (< (+ 3 l) N) (<= N (+ 2 l))), 237023#(or (<= N (+ 2 l)) (< i N)), 237026#(or (<= N (+ i 1)) (< (+ 2 i) N)), 237016#(or (<= N i) (< (+ i 1) N) (<= N l)), 237018#(< (+ l 1) N), 237020#(or (< (+ 2 l) N) (<= N (+ l 1))), 237025#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 l))), 237014#(or (<= N l) (< i N)), 237013#(< i N), 237024#(or (<= N (+ l 1)) (<= N i) (< (+ i 1) N)), 237017#(< l N), 237022#(or (<= N (+ l 1)) (< i N)), 237027#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N l)), 237028#(or (<= N (+ i 1)) (<= N (+ l 1)) (< (+ 2 i) N)), 237019#(or (< (+ l 1) N) (<= N l))] [2022-03-15 21:51:42,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:51:42,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:51:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:51:42,862 INFO L87 Difference]: Start difference. First operand 25465 states and 122087 transitions. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:44,765 INFO L93 Difference]: Finished difference Result 60842 states and 275827 transitions. [2022-03-15 21:51:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 21:51:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 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 21 [2022-03-15 21:51:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:44,996 INFO L225 Difference]: With dead ends: 60842 [2022-03-15 21:51:44,997 INFO L226 Difference]: Without dead ends: 60504 [2022-03-15 21:51:44,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1651, Invalid=6905, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 21:51:44,997 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:44,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:51:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2022-03-15 21:51:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 28764. [2022-03-15 21:51:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28764 states, 28763 states have (on average 4.781559642596391) internal successors, (137532), 28763 states have internal predecessors, (137532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28764 states to 28764 states and 137532 transitions. [2022-03-15 21:51:46,179 INFO L78 Accepts]: Start accepts. Automaton has 28764 states and 137532 transitions. Word has length 21 [2022-03-15 21:51:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:46,179 INFO L470 AbstractCegarLoop]: Abstraction has 28764 states and 137532 transitions. [2022-03-15 21:51:46,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28764 states and 137532 transitions. [2022-03-15 21:51:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:46,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:46,251 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:46,267 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 21:51:46,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:46,453 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -466735332, now seen corresponding path program 19 times [2022-03-15 21:51:46,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:46,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118798851] [2022-03-15 21:51:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:51:46,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:46,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118798851] [2022-03-15 21:51:46,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118798851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:46,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900005060] [2022-03-15 21:51:46,490 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:51:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:46,492 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 21:51:46,493 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 21:51:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:51:46,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:51:46,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:51:46,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900005060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:46,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:46,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:51:46,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200981553] [2022-03-15 21:51:46,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:46,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:46,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 278 transitions. [2022-03-15 21:51:46,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:48,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [355666#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 355661#(or (<= (+ 2 l) N) (< i N)), 355656#(or (<= N i) (< (+ i 1) N)), 355662#(or (<= (+ 3 l) N) (< i N)), 355671#(or (<= N (+ 2 i)) (<= (+ 2 l) N) (< (+ 3 i) N)), 355665#(or (<= N i) (< (+ i 1) N) (<= (+ 3 l) N)), 355669#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 355658#(or (<= (+ 2 l) N) (<= N l)), 355660#(or (<= (+ l 1) N) (< i N)), 355664#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 355667#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 355668#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 l) N)), 355672#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 3 l) N)), 355655#(< i N), 355659#(or (<= N (+ l 1)) (<= (+ 3 l) N)), 355657#(or (<= N (+ i 1)) (< (+ 2 i) N)), 355670#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< l N)), 355663#(or (<= N i) (< (+ i 1) N) (< l N))] [2022-03-15 21:51:48,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:51:48,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:51:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:51:48,283 INFO L87 Difference]: Start difference. First operand 28764 states and 137532 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:49,884 INFO L93 Difference]: Finished difference Result 71523 states and 333197 transitions. [2022-03-15 21:51:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:51:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 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 21 [2022-03-15 21:51:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:50,364 INFO L225 Difference]: With dead ends: 71523 [2022-03-15 21:51:50,364 INFO L226 Difference]: Without dead ends: 71508 [2022-03-15 21:51:50,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=3547, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:51:50,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 274 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:50,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 0 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:51:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71508 states. [2022-03-15 21:51:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71508 to 50269. [2022-03-15 21:51:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50269 states, 50268 states have (on average 4.887323943661972) internal successors, (245676), 50268 states have internal predecessors, (245676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50269 states to 50269 states and 245676 transitions. [2022-03-15 21:51:52,305 INFO L78 Accepts]: Start accepts. Automaton has 50269 states and 245676 transitions. Word has length 21 [2022-03-15 21:51:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:52,305 INFO L470 AbstractCegarLoop]: Abstraction has 50269 states and 245676 transitions. [2022-03-15 21:51:52,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 50269 states and 245676 transitions. [2022-03-15 21:51:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:51:52,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:52,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:52,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 21:51:52,665 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,SelfDestructingSolverStorable21 [2022-03-15 21:51:52,665 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2103278951, now seen corresponding path program 20 times [2022-03-15 21:51:52,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:52,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241364788] [2022-03-15 21:51:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:53,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:53,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241364788] [2022-03-15 21:51:53,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241364788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:53,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439605090] [2022-03-15 21:51:53,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:53,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:53,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:53,038 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 21:51:53,040 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 21:51:53,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:53,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:53,069 WARN L261 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 21:51:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:53,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-03-15 21:51:53,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-03-15 21:51:53,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-03-15 21:51:53,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-03-15 21:51:53,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-03-15 21:51:53,466 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:53,466 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 33 treesize of output 45 [2022-03-15 21:51:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:53,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:53,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:54,005 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:54,007 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 671909 treesize of output 655544 [2022-03-15 21:51:55,023 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 21:51:55,040 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 21:51:55,231 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,SelfDestructingSolverStorable22 [2022-03-15 21:51:55,232 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 21:51:55,234 INFO L158 Benchmark]: Toolchain (without parser) took 421807.08ms. Allocated memory was 186.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 145.0MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-15 21:51:55,234 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:51:55,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.31ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:51:55,235 INFO L158 Benchmark]: Boogie Preprocessor took 11.53ms. Allocated memory is still 186.6MB. Free memory was 143.4MB in the beginning and 142.4MB in the end (delta: 996.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:51:55,235 INFO L158 Benchmark]: RCFGBuilder took 276.46ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 132.9MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:51:55,235 INFO L158 Benchmark]: TraceAbstraction took 421496.23ms. Allocated memory was 186.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 132.3MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-15 21:51:55,236 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.10ms. Allocated memory is still 186.6MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.31ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.53ms. Allocated memory is still 186.6MB. Free memory was 143.4MB in the beginning and 142.4MB in the end (delta: 996.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.46ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 132.9MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 421496.23ms. Allocated memory was 186.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 132.3MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 26 PlacesAfterwards, 29 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 84, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 150, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 84, unknown conditional: 0, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 21:51:55,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...