/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:14:35,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:14:35,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:14:35,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:14:35,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:14:35,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:14:35,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:14:35,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:14:35,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:14:35,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:14:35,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:14:35,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:14:35,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:14:35,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:14:35,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:14:35,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:14:35,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:14:35,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:14:35,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:14:35,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:14:35,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:14:35,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:14:35,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:14:35,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:14:35,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:14:35,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:14:35,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:14:35,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:14:35,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:14:35,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:14:35,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:14:35,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:14:35,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:14:35,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:14:35,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:14:35,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:14:35,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:14:35,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:14:35,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:14:35,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:14:35,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:14:35,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 22:14:35,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:14:35,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:14:35,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:14:35,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:14:35,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:14:35,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:14:35,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:14:35,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:14:35,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:14:35,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:14:35,576 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:14:35,577 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:14:35,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:14:35,577 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:14:35,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:14:35,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:14:35,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:14:35,778 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:14:35,780 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:14:35,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl [2022-03-15 22:14:35,781 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl' [2022-03-15 22:14:35,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:14:35,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:14:35,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:14:35,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:14:35,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:14:35,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,821 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:14:35,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:14:35,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:14:35,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:14:35,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:14:35,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:14:35,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:14:35,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:14:35,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:14:35,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/1) ... [2022-03-15 22:14:35,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:14:35,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:35,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:14:35,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:14:35,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:14:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:14:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:14:35,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:14:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:14:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:14:35,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:14:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:14:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:14:35,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:14:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:14:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:14:35,898 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:14:35,931 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:14:35,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:14:36,057 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:14:36,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:14:36,067 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:14:36,081 INFO L202 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:14:36 BoogieIcfgContainer [2022-03-15 22:14:36,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:14:36,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:14:36,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:14:36,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:14:36,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:14:35" (1/2) ... [2022-03-15 22:14:36,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16701e9a and model type parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:14:36, skipping insertion in model container [2022-03-15 22:14:36,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:14:36" (2/2) ... [2022-03-15 22:14:36,086 INFO L111 eAbstractionObserver]: Analyzing ICFG parray-copy.wvr.bpl [2022-03-15 22:14:36,100 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:14:36,100 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:14:36,100 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:14:36,100 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:14:36,133 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:14:36,177 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:14:36,182 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 22:14:36,182 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:14:36,189 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:14:36,221 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 86 flow [2022-03-15 22:14:36,223 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 86 flow [2022-03-15 22:14:36,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 86 flow [2022-03-15 22:14:36,263 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2022-03-15 22:14:36,263 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:14:36,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2022-03-15 22:14:36,266 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:14:36,521 INFO L131 LiptonReduction]: Checked pairs total: 134 [2022-03-15 22:14:36,521 INFO L133 LiptonReduction]: Total number of compositions: 14 [2022-03-15 22:14:36,538 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:14:36,550 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:14:36,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:36,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:36,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash -457695074, now seen corresponding path program 1 times [2022-03-15 22:14:36,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:36,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472195701] [2022-03-15 22:14:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:36,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:36,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472195701] [2022-03-15 22:14:36,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472195701] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:14:36,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:14:36,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:14:36,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794077512] [2022-03-15 22:14:36,691 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:36,695 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:36,736 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:14:36,737 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:36,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:14:36,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:14:36,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:36,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:14:36,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:14:36,922 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:36,955 INFO L93 Difference]: Finished difference Result 31 states and 80 transitions. [2022-03-15 22:14:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:14:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 22:14:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:36,961 INFO L225 Difference]: With dead ends: 31 [2022-03-15 22:14:36,961 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 22:14:36,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:14:36,964 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:36,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:14:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 22:14:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-03-15 22:14:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:14:36,994 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 11 [2022-03-15 22:14:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:36,994 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:14:36,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:14:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:14:36,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:36,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:36,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:14:36,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1074246085, now seen corresponding path program 1 times [2022-03-15 22:14:36,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:36,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20751956] [2022-03-15 22:14:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:37,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:37,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20751956] [2022-03-15 22:14:37,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20751956] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:14:37,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:14:37,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:14:37,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258611281] [2022-03-15 22:14:37,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:37,047 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:37,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:14:37,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:37,221 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:14:37,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:14:37,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:37,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:14:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:14:37,223 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:37,249 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:14:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:14:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:14:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:37,250 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:14:37,250 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:14:37,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:14:37,251 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:37,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:14:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:14:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:14:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:14:37,256 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:14:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:37,256 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:14:37,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:14:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:14:37,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:37,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:37,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:14:37,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1277641967, now seen corresponding path program 1 times [2022-03-15 22:14:37,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:37,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423455454] [2022-03-15 22:14:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:37,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:37,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423455454] [2022-03-15 22:14:37,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423455454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:37,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286737661] [2022-03-15 22:14:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:37,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:37,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:37,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 22:14:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:37,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 22:14:37,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:37,654 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 8 treesize of output 7 [2022-03-15 22:14:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:37,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:37,698 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:14:37,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-03-15 22:14:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:37,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286737661] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:37,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:37,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-03-15 22:14:37,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060461724] [2022-03-15 22:14:37,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:37,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:37,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 63 transitions. [2022-03-15 22:14:37,758 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:38,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [408#(and (or (< j M) (= l 0) (< 0 l)) (or (= l k) (< j M) (not (= l 0))) (or (< j M) (= l 0) (<= (+ l i) N))), 406#(and (or (< j M) (= l 0)) (or (= l k) (< j M))), 407#(and (or (= l k) (<= N i) (not (= l 0))) (or (<= N i) (= l 0) (< 0 l)) (or (<= (+ l i 1) N) (<= N i))), 403#(and (or (= (select A l) (select B l)) (< j M)) (or (< j M) (= l 0))), 405#(and (or (< j M) (= l 0) (< i N)) (or (= (select A l) (select B l)) (< j M) (< i N))), 410#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (= M 0) (not (<= M 0))) (or (<= (+ l i 1) N) (<= N i) (not (= M 0))) (or (= l k) (<= N i) (not (= l 0)) (not (= M 0))) (or (<= N i) (= l 0) (not (= M 0)) (< 0 l))), 404#(and (or (= l 0) (< i N)) (or (= (select A l) (select B l)) (< i N))), 409#(and (or (<= (+ l i 1) N) (<= N i) (< j M)) (or (<= N i) (< j M) (= l 0) (< 0 l)) (or (= l k) (<= N i) (< j M) (not (= l 0))))] [2022-03-15 22:14:38,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:14:38,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:14:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:14:38,520 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:39,127 INFO L93 Difference]: Finished difference Result 114 states and 288 transitions. [2022-03-15 22:14:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 22:14:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:14:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:39,128 INFO L225 Difference]: With dead ends: 114 [2022-03-15 22:14:39,128 INFO L226 Difference]: Without dead ends: 96 [2022-03-15 22:14:39,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:14:39,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:39,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:14:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-15 22:14:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2022-03-15 22:14:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.8392857142857144) internal successors, (159), 56 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 159 transitions. [2022-03-15 22:14:39,136 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 159 transitions. Word has length 13 [2022-03-15 22:14:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:39,137 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 159 transitions. [2022-03-15 22:14:39,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 159 transitions. [2022-03-15 22:14:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:14:39,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:39,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:39,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:39,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:39,352 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1407549701, now seen corresponding path program 2 times [2022-03-15 22:14:39,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:39,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951196674] [2022-03-15 22:14:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:39,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:39,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951196674] [2022-03-15 22:14:39,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951196674] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:39,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907094314] [2022-03-15 22:14:39,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:14:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:39,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:39,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:14:39,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:14:39,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:39,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:14:39,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:39,573 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 8 treesize of output 7 [2022-03-15 22:14:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:39,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:39,605 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 22:14:39,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-03-15 22:14:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:39,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907094314] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:39,673 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:39,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 22:14:39,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1905227267] [2022-03-15 22:14:39,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:39,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:39,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 42 transitions. [2022-03-15 22:14:39,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:40,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [747#(and (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (= l 0) (<= (+ l k 1) N)) (or (< j M) (= l 0) (not (<= l 0)))), 742#(and (or (= (select A l) (select B l)) (< j M)) (or (< j M) (= l 0))), 745#(and (or (< j M) (= l 0)) (or (< j M) (= l i))), 744#(and (or (< j M) (= l 0) (< k N)) (or (= (select A l) (select B l)) (< j M) (< k N))), 743#(and (or (= l 0) (< k N)) (or (= (select A l) (select B l)) (< k N))), 746#(and (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (= l 0) (<= (+ l k) N)) (or (< j M) (= l 0) (not (<= l 0))))] [2022-03-15 22:14:40,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:14:40,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:14:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:14:40,059 INFO L87 Difference]: Start difference. First operand 57 states and 159 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:40,312 INFO L93 Difference]: Finished difference Result 80 states and 224 transitions. [2022-03-15 22:14:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:14:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:14:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:40,313 INFO L225 Difference]: With dead ends: 80 [2022-03-15 22:14:40,313 INFO L226 Difference]: Without dead ends: 74 [2022-03-15 22:14:40,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:14:40,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:40,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:14:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-15 22:14:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2022-03-15 22:14:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.967741935483871) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 184 transitions. [2022-03-15 22:14:40,318 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 184 transitions. Word has length 13 [2022-03-15 22:14:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:40,318 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 184 transitions. [2022-03-15 22:14:40,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 184 transitions. [2022-03-15 22:14:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:40,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:40,319 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:40,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:40,527 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 22:14:40,527 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1171727547, now seen corresponding path program 3 times [2022-03-15 22:14:40,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:40,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295193636] [2022-03-15 22:14:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:40,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:40,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295193636] [2022-03-15 22:14:40,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295193636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:40,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930017014] [2022-03-15 22:14:40,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:14:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:40,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:40,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:14:40,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:14:40,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:40,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:40,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:40,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:40,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930017014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:40,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:40,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 22:14:40,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212138567] [2022-03-15 22:14:40,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:40,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:40,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 73 transitions. [2022-03-15 22:14:40,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:41,138 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1063#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 1058#(or (< j M) (< k N) (< i N)), 1054#(or (<= (+ k 1) N) (< j M)), 1057#(or (< j M) (< i N)), 1062#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 2 j) N))), 1038#(or (<= (+ 2 k) N) (< j M)), 1056#(or (< k N) (< i N)), 1064#(and (or (<= N (+ i 1)) (<= (+ 2 j) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1055#(< i N), 1053#(< j M), 1061#(or (<= N i) (<= (+ 2 k) N) (< j M)), 1059#(or (<= N i) (<= (+ 2 k) N)), 1060#(or (<= N (+ i 1)) (<= (+ 2 k) N))] [2022-03-15 22:14:41,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:14:41,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:14:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:14:41,140 INFO L87 Difference]: Start difference. First operand 63 states and 184 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:41,824 INFO L93 Difference]: Finished difference Result 214 states and 560 transitions. [2022-03-15 22:14:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:14:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:14:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:41,826 INFO L225 Difference]: With dead ends: 214 [2022-03-15 22:14:41,826 INFO L226 Difference]: Without dead ends: 214 [2022-03-15 22:14:41,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=656, Invalid=2100, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:14:41,828 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:41,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:14:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-03-15 22:14:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 95. [2022-03-15 22:14:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 3.276595744680851) internal successors, (308), 94 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 308 transitions. [2022-03-15 22:14:41,837 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 308 transitions. Word has length 14 [2022-03-15 22:14:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:41,838 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 308 transitions. [2022-03-15 22:14:41,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 308 transitions. [2022-03-15 22:14:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:41,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:41,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:41,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:42,054 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 22:14:42,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -43920566, now seen corresponding path program 1 times [2022-03-15 22:14:42,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:42,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680573629] [2022-03-15 22:14:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:42,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:42,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680573629] [2022-03-15 22:14:42,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680573629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:42,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97929254] [2022-03-15 22:14:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:42,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:42,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:14:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:42,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:14:42,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:42,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:42,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97929254] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:42,185 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:42,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:14:42,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75064490] [2022-03-15 22:14:42,185 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:42,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:42,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 68 transitions. [2022-03-15 22:14:42,190 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:42,410 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1614#(or (< j M) (< i N)), 1616#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 1612#(< j M), 1615#(or (< (+ j 1) M) (< i N) (<= M j)), 1613#(or (< (+ j 1) M) (<= M j)), 1617#(or (<= N i) (<= (+ M i 1) (+ N j)))] [2022-03-15 22:14:42,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:14:42,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:14:42,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:14:42,412 INFO L87 Difference]: Start difference. First operand 95 states and 308 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:42,590 INFO L93 Difference]: Finished difference Result 200 states and 592 transitions. [2022-03-15 22:14:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 22:14:42,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:14:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:42,591 INFO L225 Difference]: With dead ends: 200 [2022-03-15 22:14:42,592 INFO L226 Difference]: Without dead ends: 200 [2022-03-15 22:14:42,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:14:42,592 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:42,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:14:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-03-15 22:14:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 123. [2022-03-15 22:14:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 3.3524590163934427) internal successors, (409), 122 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 409 transitions. [2022-03-15 22:14:42,599 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 409 transitions. Word has length 14 [2022-03-15 22:14:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:42,599 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 409 transitions. [2022-03-15 22:14:42,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 409 transitions. [2022-03-15 22:14:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:42,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:42,601 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:42,624 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 22:14:42,813 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 22:14:42,813 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1301635281, now seen corresponding path program 4 times [2022-03-15 22:14:42,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:42,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955170584] [2022-03-15 22:14:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:42,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:42,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955170584] [2022-03-15 22:14:42,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955170584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:42,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365819041] [2022-03-15 22:14:42,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:14:42,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:42,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:42,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:42,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:14:42,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:14:42,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:42,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:42,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:42,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:43,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365819041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:43,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:43,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:14:43,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848415913] [2022-03-15 22:14:43,025 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:43,027 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:43,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2022-03-15 22:14:43,031 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:43,218 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2173#(or (<= N i) (<= k i)), 2174#(or (<= N i) (<= k i) (< j M)), 2165#(or (<= k i) (< j M)), 2170#(or (<= N i) (< j M)), 2171#(< k N), 2175#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 2169#(< j M), 2158#(or (< j M) (<= (+ k 1) i)), 2172#(or (< j M) (< k N))] [2022-03-15 22:14:43,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:14:43,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:14:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:14:43,219 INFO L87 Difference]: Start difference. First operand 123 states and 409 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:43,566 INFO L93 Difference]: Finished difference Result 235 states and 740 transitions. [2022-03-15 22:14:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:14:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:14:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:43,568 INFO L225 Difference]: With dead ends: 235 [2022-03-15 22:14:43,568 INFO L226 Difference]: Without dead ends: 234 [2022-03-15 22:14:43,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:14:43,569 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:43,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:14:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-03-15 22:14:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 142. [2022-03-15 22:14:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.4539007092198584) internal successors, (487), 141 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 487 transitions. [2022-03-15 22:14:43,577 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 487 transitions. Word has length 14 [2022-03-15 22:14:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:43,577 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 487 transitions. [2022-03-15 22:14:43,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 487 transitions. [2022-03-15 22:14:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:43,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:43,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:43,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 22:14:43,778 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 22:14:43,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:43,779 INFO L85 PathProgramCache]: Analyzing trace with hash 361843972, now seen corresponding path program 2 times [2022-03-15 22:14:43,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:43,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596922742] [2022-03-15 22:14:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:43,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:43,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:43,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596922742] [2022-03-15 22:14:43,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596922742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:43,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399912144] [2022-03-15 22:14:43,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:14:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:43,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:43,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:14:43,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:14:43,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:43,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:14:43,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:43,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:14:43,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399912144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:43,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:43,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:14:43,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634993302] [2022-03-15 22:14:43,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:43,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:43,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 62 transitions. [2022-03-15 22:14:43,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:44,074 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [2814#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 2810#(< j M), 2811#(or (< j M) (< i N)), 2812#(or (<= N i) (<= (+ 2 i) N)), 2813#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:14:44,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:14:44,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:14:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:14:44,075 INFO L87 Difference]: Start difference. First operand 142 states and 487 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:44,177 INFO L93 Difference]: Finished difference Result 193 states and 629 transitions. [2022-03-15 22:14:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 22:14:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:14:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:44,178 INFO L225 Difference]: With dead ends: 193 [2022-03-15 22:14:44,178 INFO L226 Difference]: Without dead ends: 193 [2022-03-15 22:14:44,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:14:44,179 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:44,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:14:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-03-15 22:14:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 156. [2022-03-15 22:14:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.4516129032258065) internal successors, (535), 155 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 535 transitions. [2022-03-15 22:14:44,185 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 535 transitions. Word has length 14 [2022-03-15 22:14:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:44,185 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 535 transitions. [2022-03-15 22:14:44,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 535 transitions. [2022-03-15 22:14:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:44,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:44,186 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:44,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:44,402 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 22:14:44,402 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 819783040, now seen corresponding path program 5 times [2022-03-15 22:14:44,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:44,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800566800] [2022-03-15 22:14:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:44,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:44,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800566800] [2022-03-15 22:14:44,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800566800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:44,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380326441] [2022-03-15 22:14:44,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:14:44,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:44,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:44,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:14:44,477 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:14:44,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:44,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:44,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:44,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:44,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380326441] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:44,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:44,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2022-03-15 22:14:44,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130364477] [2022-03-15 22:14:44,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:44,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:44,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2022-03-15 22:14:44,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:44,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3417#(or (<= (+ i 1) k) (< j M)), 3413#(or (< j M) (<= N k)), 3416#(or (< j M) (<= i k)), 3414#(< i N), 3415#(or (< j M) (< i N)), 3412#(< j M)] [2022-03-15 22:14:44,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:14:44,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:14:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:14:44,702 INFO L87 Difference]: Start difference. First operand 156 states and 535 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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 22:14:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:44,821 INFO L93 Difference]: Finished difference Result 211 states and 680 transitions. [2022-03-15 22:14:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 22:14:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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 14 [2022-03-15 22:14:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:44,823 INFO L225 Difference]: With dead ends: 211 [2022-03-15 22:14:44,823 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 22:14:44,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:14:44,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:44,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:14:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 22:14:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2022-03-15 22:14:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 3.430167597765363) internal successors, (614), 179 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 614 transitions. [2022-03-15 22:14:44,829 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 614 transitions. Word has length 14 [2022-03-15 22:14:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:44,829 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 614 transitions. [2022-03-15 22:14:44,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 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 22:14:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 614 transitions. [2022-03-15 22:14:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:14:44,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:44,830 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:44,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:45,039 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 22:14:45,039 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1505863744, now seen corresponding path program 6 times [2022-03-15 22:14:45,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:45,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255125553] [2022-03-15 22:14:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:45,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:45,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255125553] [2022-03-15 22:14:45,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255125553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:45,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174733758] [2022-03-15 22:14:45,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:14:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:45,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:45,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:14:45,111 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:14:45,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:45,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:45,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:45,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:45,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174733758] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:45,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:45,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:14:45,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180804051] [2022-03-15 22:14:45,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:45,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:45,194 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 45 transitions. [2022-03-15 22:14:45,194 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:45,352 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [4087#(< j M), 4094#(or (< j M) (<= i k)), 4090#(or (< k N) (< i N)), 4086#(< k N), 4088#(or (< j M) (< i N)), 4091#(or (< j M) (< k N)), 4092#(or (< j M) (< k N) (< i N)), 4089#(or (< j M) (<= (+ 2 i) N)), 4093#(or (<= (+ i 1) k) (< j M))] [2022-03-15 22:14:45,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:14:45,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:14:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:14:45,352 INFO L87 Difference]: Start difference. First operand 180 states and 614 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:45,509 INFO L93 Difference]: Finished difference Result 244 states and 779 transitions. [2022-03-15 22:14:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:14:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:14:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:45,511 INFO L225 Difference]: With dead ends: 244 [2022-03-15 22:14:45,511 INFO L226 Difference]: Without dead ends: 244 [2022-03-15 22:14:45,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:14:45,511 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:45,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:14:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-03-15 22:14:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 182. [2022-03-15 22:14:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 3.453038674033149) internal successors, (625), 181 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 625 transitions. [2022-03-15 22:14:45,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 625 transitions. Word has length 14 [2022-03-15 22:14:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:45,516 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 625 transitions. [2022-03-15 22:14:45,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 625 transitions. [2022-03-15 22:14:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:14:45,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:45,517 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:45,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 22:14:45,731 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 22:14:45,732 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1055540842, now seen corresponding path program 3 times [2022-03-15 22:14:45,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:45,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51452117] [2022-03-15 22:14:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:46,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:46,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51452117] [2022-03-15 22:14:46,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51452117] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:46,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798341080] [2022-03-15 22:14:46,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:14:46,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:46,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:46,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:14:46,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:14:46,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:46,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:14:46,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:46,139 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 8 treesize of output 7 [2022-03-15 22:14:46,239 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:14:46,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:14:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:46,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:46,444 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:14:46,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 26 [2022-03-15 22:14:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:46,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798341080] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:46,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:46,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:14:46,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346652961] [2022-03-15 22:14:46,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:46,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:46,532 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 73 transitions. [2022-03-15 22:14:46,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:47,762 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [4831#(and (or (<= N (+ i 1)) (= M l) (not (<= l M)) (= l 0) (not (<= l 0))) (or (<= N (+ i 1)) (<= (+ l i 1) N) (<= l M)) (or (<= N (+ i 1)) (= M l) (not (= l 0)) (= l j)) (or (<= N (+ i 1)) (<= l M) (= j 0)) (or (<= N (+ i 1)) (= M l) (not (<= l M)) (not (= l 0)) (not (= k j))) (or (<= N (+ i 1)) (<= (+ M i 1) N) (= M l) (= l 0)) (or (<= N (+ i 1)) (= l k) (not (= M l)))), 4826#(and (or (= (select A l) (select B l)) (= l k) (< j M) (< i N)) (or (= l k) (< j M) (= l 0) (< i N))), 4825#(or (= (select A l) (select B l)) (< j M) (< i N)), 4828#(and (or (< (+ j 1) M) (= l k) (< (+ i 1) N) (= l 0) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (< (+ i 1) N) (not (< i N)) (not (< j M)) (= l i) (= l j))), 4822#(and (or (= (select A l) (select B l)) (= l k) (< j M)) (or (= l k) (< j M) (= l 0))), 4823#(and (or (< (+ j 1) M) (= l k) (= l 0) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (= l j))), 4830#(and (or (= l k) (<= N i) (not (= M l))) (or (= M l) (<= N i) (not (= l 0)) (= l j)) (or (= M l) (<= N i) (not (<= l M)) (= l 0) (not (<= l 0))) (or (= M l) (<= N i) (= l 0) (<= (+ M i) N)) (or (<= N i) (<= l M) (= j 0)) (or (= M l) (<= N i) (not (<= l M)) (not (= l 0)) (not (= k j))) (or (<= N i) (<= l M) (<= (+ l i) N))), 4827#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (< i N) (= l j)) (or (< (+ j 1) M) (= l k) (= l 0) (not (< j M)) (< i N))), 4829#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0) (not (< j M)))), 4821#(or (= (select A l) (select B l)) (< j M)), 4824#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:14:47,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:14:47,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:14:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:14:47,763 INFO L87 Difference]: Start difference. First operand 182 states and 625 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:51,201 INFO L93 Difference]: Finished difference Result 475 states and 1390 transitions. [2022-03-15 22:14:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:14:51,201 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:14:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:51,203 INFO L225 Difference]: With dead ends: 475 [2022-03-15 22:14:51,203 INFO L226 Difference]: Without dead ends: 413 [2022-03-15 22:14:51,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=596, Invalid=3436, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:14:51,205 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:51,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:14:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-03-15 22:14:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 207. [2022-03-15 22:14:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 3.5242718446601944) internal successors, (726), 206 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 726 transitions. [2022-03-15 22:14:51,212 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 726 transitions. Word has length 15 [2022-03-15 22:14:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:51,212 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 726 transitions. [2022-03-15 22:14:51,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 726 transitions. [2022-03-15 22:14:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:14:51,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:51,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:51,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:51,419 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 22:14:51,419 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1963840544, now seen corresponding path program 7 times [2022-03-15 22:14:51,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:51,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833702280] [2022-03-15 22:14:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:51,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:51,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833702280] [2022-03-15 22:14:51,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833702280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:51,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138227106] [2022-03-15 22:14:51,627 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:14:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:51,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:51,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:14:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:51,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:14:51,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:51,823 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 22:14:51,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:14:51,849 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 20 treesize of output 22 [2022-03-15 22:14:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:51,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:51,930 INFO L353 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2022-03-15 22:14:51,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 22 [2022-03-15 22:14:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:52,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138227106] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:52,063 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:52,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 22:14:52,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832457443] [2022-03-15 22:14:52,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:52,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:52,067 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 88 transitions. [2022-03-15 22:14:52,067 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:53,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [5899#(and (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< i N)) (or (= l k) (<= (+ 2 k) N) (= l 0) (< i N))), 5893#(and (or (= l k) (<= (+ 2 k) N) (< j M) (= l 0)) (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M))), 5892#(or (= (select A l) (select B l)) (< j M) (< k N)), 5900#(and (or (= l k) (<= (+ 2 k) N) (< j M) (= l 0) (< i N)) (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M) (< i N))), 5897#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 5898#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 5902#(and (or (<= N i) (< j M) (= k 0)) (or (<= (+ 3 k) N) (<= N i) (< (+ i 1) N) (< j M) (= l 0) (= l (+ k 1))) (or (<= N i) (< j M) (<= 2 N))), 5891#(or (= (select A l) (select B l)) (< j M)), 5895#(or (= (select A l) (select B l)) (< i N)), 5905#(and (or (<= N (+ i 1)) (<= (+ 3 i) N) (< 2 N) (< j M) (= l 0) (= (+ (- 1) N) l)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< j M) (<= 2 N))), 5896#(or (= (select A l) (select B l)) (< j M) (< i N)), 5890#(and (or (< 2 N) (<= N i) (= l 0) (= (+ (- 1) N) l) (<= (+ 2 i) N)) (or (<= N i) (<= 2 N)) (or (<= N i) (= k 0))), 5901#(and (or (< j M) (<= 2 N)) (or (< j M) (= k 0)) (or (<= (+ 3 k) N) (< j M) (= l 0) (= l (+ k 1)) (< i N))), 5903#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (<= 2 N) (not (= M 0))) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (< 2 N) (<= N i) (= l 0) (= (+ (- 1) N) l) (not (= M 0)) (<= (+ 2 i) N))), 5894#(and (or (< 2 N) (< j M) (= l 0) (= (+ (- 1) N) l)) (or (< j M) (<= 2 N)) (or (< j M) (= k 0))), 5906#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (<= 2 N) (not (= M 0))) (or (<= N (+ i 1)) (<= (+ 3 i) N) (< 2 N) (= l 0) (= (+ (- 1) N) l) (not (= M 0))) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (<= N (+ i 1)) (= M 0) (= j 0))), 5904#(and (or (<= N (+ i 1)) (<= 2 N)) (or (<= N (+ i 1)) (<= (+ 3 i) N) (< 2 N) (= l 0) (= (+ (- 1) N) l)) (or (<= N (+ i 1)) (= k 0)))] [2022-03-15 22:14:53,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:14:53,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:14:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:14:53,454 INFO L87 Difference]: Start difference. First operand 207 states and 726 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:57,306 INFO L93 Difference]: Finished difference Result 467 states and 1384 transitions. [2022-03-15 22:14:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 22:14:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:14:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:57,308 INFO L225 Difference]: With dead ends: 467 [2022-03-15 22:14:57,308 INFO L226 Difference]: Without dead ends: 452 [2022-03-15 22:14:57,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1270, Invalid=6562, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:14:57,310 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 453 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:57,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 0 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:14:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-03-15 22:14:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 233. [2022-03-15 22:14:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 3.4827586206896552) internal successors, (808), 232 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 808 transitions. [2022-03-15 22:14:57,316 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 808 transitions. Word has length 15 [2022-03-15 22:14:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:57,316 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 808 transitions. [2022-03-15 22:14:57,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 808 transitions. [2022-03-15 22:14:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:14:57,317 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:57,317 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:57,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:57,533 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 22:14:57,533 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash -582377488, now seen corresponding path program 4 times [2022-03-15 22:14:57,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:57,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789420491] [2022-03-15 22:14:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:57,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:57,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789420491] [2022-03-15 22:14:57,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789420491] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:57,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270565469] [2022-03-15 22:14:57,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:14:57,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:57,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:57,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:14:57,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:14:57,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:57,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:14:57,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:58,063 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 8 treesize of output 7 [2022-03-15 22:14:58,144 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:14:58,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:14:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:58,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:58,275 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:14:58,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 26 [2022-03-15 22:14:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:58,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270565469] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:58,393 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:58,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 22:14:58,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [396869223] [2022-03-15 22:14:58,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:58,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:58,396 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 61 transitions. [2022-03-15 22:14:58,396 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:59,581 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [7052#(and (or (= l 0) (<= l M) (< k N)) (or (= l 0) (< k N) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N))), 7047#(and (or (not (= l j)) (not (= (+ l (* (- 1) M)) 0)) (< i N)) (or (= (select A l) (select B l)) (not (= (+ l (* (- 1) M)) 0)) (< i N)) (or (= (+ l (* (- 1) M)) 0) (= l 0) (< i N)) (or (= (+ l (* (- 1) M)) 0) (< i N) (= l j))), 7048#(or (= (select A l) (select B l)) (< k N)), 7053#(and (or (= l 0) (< k N) (< i N) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (< i N)) (or (= l 0) (<= l M) (< k N) (< i N))), 7050#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= l 0) (<= (+ M i) N) (< M (+ l 1))) (or (<= (+ l 1) N) (<= N i) (= l 0) (<= l M)) (or (<= N i) (= (+ l (* (- 1) M)) 0) (not (= l 0)) (= l j)) (or (<= N i) (= l 0) (< 0 l) (< M (+ l 1))) (or (<= N i) (<= (+ 2 M) N) (not (= (+ l (* (- 1) M)) 0)) (not (= k j)))), 7049#(or (= (select A l) (select B l)) (< k N) (< i N)), 7046#(and (or (= l 0) (<= l M) (< i N)) (or (= l 0) (< i N) (< M (+ l 1))) (or (= (select A l) (select B l)) (< i N))), 7054#(and (or (= (+ l (* (- 1) M)) 0) (= l 0) (< i N) (<= (+ l k) (+ N M))) (or (= (select A l) (select B l)) (< k N) (not (= (+ l (* (- 1) M)) 0)) (< i N)) (or (= l 0) (< i N) (< M (+ l 1))) (or (not (= l j)) (< k N) (not (= (+ l (* (- 1) M)) 0)) (< i N)) (or (= (+ l (* (- 1) M)) 0) (not (= l 0)) (< i N) (= l j))), 7051#(and (or (<= N (+ i 1)) (= l 0) (< 0 l) (< M (+ l 1))) (or (<= N (+ i 1)) (<= (+ l 1) N) (= l 0) (<= l M)) (or (<= N (+ i 1)) (<= (+ M i 1) N) (= l 0) (< M (+ l 1))) (or (<= N (+ i 1)) (<= (+ 2 M) N) (not (= (+ l (* (- 1) M)) 0)) (not (= k j))) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (= (+ l (* (- 1) M)) 0) (not (= l 0)) (= l j))), 7045#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:14:59,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:14:59,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:59,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:14:59,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:14:59,582 INFO L87 Difference]: Start difference. First operand 233 states and 808 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:00,948 INFO L93 Difference]: Finished difference Result 358 states and 1122 transitions. [2022-03-15 22:15:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:15:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:00,950 INFO L225 Difference]: With dead ends: 358 [2022-03-15 22:15:00,950 INFO L226 Difference]: Without dead ends: 342 [2022-03-15 22:15:00,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:15:00,951 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:00,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:15:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-03-15 22:15:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 236. [2022-03-15 22:15:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.497872340425532) internal successors, (822), 235 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 822 transitions. [2022-03-15 22:15:00,962 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 822 transitions. Word has length 15 [2022-03-15 22:15:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:00,962 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 822 transitions. [2022-03-15 22:15:00,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 822 transitions. [2022-03-15 22:15:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:00,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:00,963 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:00,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:01,175 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 22:15:01,175 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -649776304, now seen corresponding path program 5 times [2022-03-15 22:15:01,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:01,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914714123] [2022-03-15 22:15:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:01,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:01,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914714123] [2022-03-15 22:15:01,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914714123] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:01,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706325663] [2022-03-15 22:15:01,471 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:01,472 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:01,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:15:01,498 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:15:01,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:01,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 22:15:01,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:01,559 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 8 treesize of output 7 [2022-03-15 22:15:01,598 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 14 treesize of output 16 [2022-03-15 22:15:01,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:01,714 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 16 treesize of output 18 [2022-03-15 22:15:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:01,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:01,862 INFO L353 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-03-15 22:15:01,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 34 [2022-03-15 22:15:01,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:01,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 98 treesize of output 94 [2022-03-15 22:15:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:02,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706325663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:02,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:02,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:02,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1437677137] [2022-03-15 22:15:02,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:02,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:02,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 67 transitions. [2022-03-15 22:15:02,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:02,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [8021#(and (or (= l k) (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (= l k) (< j M) (not (< i N)) (<= (+ 2 i) N) (= l i))), 8022#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< i N)) (not (< j M)) (<= (+ 2 i) N) (= l i) (= l j)) (or (< (+ j 1) M) (= l k) (= l 0) (not (< i N)) (not (< j M)) (<= (+ 2 i) N))), 8018#(and (or (= (select A l) (select B l)) (= l k) (< j M)) (or (= l k) (< j M) (= l 0))), 8017#(or (= (select A l) (select B l)) (< j M) (< i N)), 8019#(and (or (= (select A l) (select B l)) (= l k) (< j M) (< i N)) (or (= l k) (< j M) (= l 0) (< i N))), 8016#(or (= (select A l) (select B l)) (< i N)), 8015#(or (= (select A l) (select B l)) (< j M)), 8020#(and (or (= l k) (= l 0) (not (< i N)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (= l k) (not (< i N)) (<= (+ 2 i) N) (= l i))), 8023#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (< j M)))), 8024#(and (or (= l k) (<= N i) (not (= M l))) (or (<= (+ M 1) N) (= M l) (<= N i) (not (<= l M)) (= (+ i 1) M) (not (= l 0))) (or (< i M) (= M l) (<= N i) (not (= l 0)) (< M l)) (or (= M l) (<= N i) (not (<= l M)) (= l 0) (not (<= l 0))) (or (<= (+ M i 1) N) (= M l) (<= N i) (= l 0)) (or (= M l) (<= N i) (not (<= l M)) (not (= (+ i 1) M)) (not (= l 0)) (not (= k j))) (or (<= (+ l i 1) N) (= M l) (<= N i)) (or (<= N i) (= j 0)))] [2022-03-15 22:15:02,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:15:02,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:02,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:15:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:15:02,907 INFO L87 Difference]: Start difference. First operand 236 states and 822 transitions. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:05,951 INFO L93 Difference]: Finished difference Result 564 states and 1697 transitions. [2022-03-15 22:15:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 22:15:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:05,953 INFO L225 Difference]: With dead ends: 564 [2022-03-15 22:15:05,953 INFO L226 Difference]: Without dead ends: 467 [2022-03-15 22:15:05,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=680, Invalid=3102, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:15:05,954 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:05,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-03-15 22:15:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 253. [2022-03-15 22:15:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.4722222222222223) internal successors, (875), 252 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 875 transitions. [2022-03-15 22:15:05,960 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 875 transitions. Word has length 15 [2022-03-15 22:15:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:05,961 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 875 transitions. [2022-03-15 22:15:05,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 875 transitions. [2022-03-15 22:15:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:05,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:05,961 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:05,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 22:15:06,175 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 22:15:06,176 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1710977514, now seen corresponding path program 6 times [2022-03-15 22:15:06,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:06,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538572321] [2022-03-15 22:15:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:06,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:06,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538572321] [2022-03-15 22:15:06,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538572321] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:06,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938948363] [2022-03-15 22:15:06,440 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:15:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:06,464 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:06,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 22:15:06,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:15:06,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:06,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 22:15:06,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:06,557 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 22:15:06,626 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:15:06,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:15:06,693 INFO L353 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2022-03-15 22:15:06,693 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 23 [2022-03-15 22:15:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:06,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:06,845 INFO L353 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-03-15 22:15:06,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 48 [2022-03-15 22:15:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:06,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938948363] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:06,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:06,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:06,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194387398] [2022-03-15 22:15:06,929 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:06,930 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:06,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2022-03-15 22:15:06,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:07,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [9269#(and (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ i 1) M))) (or (= M l) (<= N i) (not (= (+ i 1) M)) (not (= l 0)) (not (= k j))) (or (<= N i) (<= l M) (not (= (+ i 1) M)) (= M k)) (or (< i M) (<= N i) (<= i 0)) (or (<= N i) (= j 0)) (or (<= M (+ i 1)) (<= N i) (<= 0 i)) (or (<= N i) (= l 0) (not (= (+ i 1) M)) (< 0 l) (< M (+ l 1)))), 9267#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (= l 0) (not (< j M)) (= l i)) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (not (= l k)) (= l i)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (= l i) (= l j))), 9265#(and (or (= (select A l) (select B l)) (< j M) (< k N) (= l i)) (or (< j M) (= l 0) (< k N) (= l i))), 9268#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (not (= l k)) (= (+ i 1) l)) (or (< (+ j 1) M) (<= (+ 2 k) N) (= l 0) (not (< i N)) (not (< j M)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l))), 9266#(and (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (= l i)) (or (<= (+ 2 k) N) (< j M) (= l 0) (= l i)) (or (<= (+ 2 k) N) (< j M) (not (= l k)) (= l i))), 9263#(or (= (select A l) (select B l)) (< k N)), 9261#(or (= (select A l) (select B l)) (< j M)), 9264#(or (= (select A l) (select B l)) (< j M) (< k N)), 9262#(and (or (= (select A l) (select B l)) (< j M) (= l i)) (or (< j M) (= l 0) (= l i)))] [2022-03-15 22:15:07,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:15:07,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:15:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:15:07,692 INFO L87 Difference]: Start difference. First operand 253 states and 875 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:09,650 INFO L93 Difference]: Finished difference Result 423 states and 1287 transitions. [2022-03-15 22:15:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 22:15:09,650 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:09,652 INFO L225 Difference]: With dead ends: 423 [2022-03-15 22:15:09,652 INFO L226 Difference]: Without dead ends: 411 [2022-03-15 22:15:09,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=430, Invalid=2326, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:15:09,653 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:09,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-15 22:15:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 258. [2022-03-15 22:15:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.490272373540856) internal successors, (897), 257 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 897 transitions. [2022-03-15 22:15:09,661 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 897 transitions. Word has length 15 [2022-03-15 22:15:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:09,661 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 897 transitions. [2022-03-15 22:15:09,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 897 transitions. [2022-03-15 22:15:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:09,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:09,662 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:09,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:09,875 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 22:15:09,875 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash -191837236, now seen corresponding path program 8 times [2022-03-15 22:15:09,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:09,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708119755] [2022-03-15 22:15:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:10,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:10,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708119755] [2022-03-15 22:15:10,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708119755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:10,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323650155] [2022-03-15 22:15:10,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:10,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:10,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:10,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:15:10,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:10,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:10,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 22:15:10,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:10,211 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 22:15:10,255 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:15:10,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:15:10,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:10,358 INFO L353 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-03-15 22:15:10,358 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-03-15 22:15:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:10,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:10,519 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:15:10,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:15:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:10,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323650155] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:10,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:10,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:10,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821655555] [2022-03-15 22:15:10,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:10,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:10,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 62 transitions. [2022-03-15 22:15:10,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:11,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [10369#(and (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (<= (+ l 1) (+ N i)) (= (+ i 1) l)) (or (<= N i) (<= 0 i) (< j M)) (or (<= N i) (< j M) (= l 0) (not (<= l (+ i 1))) (= (+ i 1) l))), 10366#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 10363#(or (= (select A l) (select B l)) (< i N)), 10365#(or (= (select A l) (select B l)) (< j M) (< i N)), 10360#(or (= (select A l) (select B l)) (< j M)), 10364#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 10359#(and (or (<= N i) (<= (+ l 1) (+ N i)) (= (+ i 1) l)) (or (<= N i) (<= 0 i)) (or (<= N i) (= l 0) (not (<= l (+ i 1))) (= (+ i 1) l)) (or (<= N i) (= k 0))), 10367#(and (or (< j M) (not (= k i)) (<= (+ l k 1) (+ N i)) (<= l i)) (or (< j M) (not (= k i)) (= l 0) (= l i) (not (<= l i))) (or (= (select A l) (select B l)) (< j M) (not (= k i)) (= l i) (not (<= l i))) (or (< j M) (< k (+ i 1)))), 10368#(and (or (< j M) (<= (+ 2 l) (+ N i)) (<= l i)) (or (< j M) (= l 0) (= l i) (not (<= l i))) (or (< j M) (<= 1 i)) (or (< j M) (= k 0))), 10362#(and (or (= l k) (<= (+ 2 k) N) (< j M) (= l 0)) (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M))), 10370#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (<= 0 i) (not (= M 0))) (or (<= N i) (not (= M 0)) (<= (+ l 1) (+ N i)) (= (+ i 1) l)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (<= N i) (= l 0) (not (<= l (+ i 1))) (not (= M 0)) (= (+ i 1) l))), 10361#(or (= (select A l) (select B l)) (< j M) (< k N))] [2022-03-15 22:15:11,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:15:11,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:15:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:15:11,480 INFO L87 Difference]: Start difference. First operand 258 states and 897 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:14,328 INFO L93 Difference]: Finished difference Result 475 states and 1446 transitions. [2022-03-15 22:15:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:15:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:14,331 INFO L225 Difference]: With dead ends: 475 [2022-03-15 22:15:14,331 INFO L226 Difference]: Without dead ends: 464 [2022-03-15 22:15:14,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=870, Invalid=4680, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 22:15:14,332 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:14,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:15:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-03-15 22:15:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 259. [2022-03-15 22:15:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 3.4806201550387597) internal successors, (898), 258 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 898 transitions. [2022-03-15 22:15:14,338 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 898 transitions. Word has length 15 [2022-03-15 22:15:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:14,338 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 898 transitions. [2022-03-15 22:15:14,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 898 transitions. [2022-03-15 22:15:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:14,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:14,340 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:14,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:14,551 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 22:15:14,551 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1855051208, now seen corresponding path program 7 times [2022-03-15 22:15:14,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:14,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958848934] [2022-03-15 22:15:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:14,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:14,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:14,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958848934] [2022-03-15 22:15:14,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958848934] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:14,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51790453] [2022-03-15 22:15:14,835 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:15:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:14,836 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:14,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 22:15:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:14,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:15:14,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:14,980 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 22:15:15,006 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 16 treesize of output 18 [2022-03-15 22:15:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:15,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:15,127 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:15:15,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 26 [2022-03-15 22:15:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:15,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51790453] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:15,235 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:15,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:15,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [855768555] [2022-03-15 22:15:15,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:15,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:15,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 46 transitions. [2022-03-15 22:15:15,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:15,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [11554#(or (= (select A l) (select B l)) (<= N i) (= l i)), 11552#(or (= (select A l) (select B l)) (< k N)), 11556#(and (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ i 1) M))) (or (<= N i) (= j 0)) (or (<= N i) (= l 0) (not (<= l 0)) (not (= (+ i 1) M)) (not (<= (+ l 1) M))) (or (<= M (+ i 1)) (<= N i) (<= 0 i)) (or (<= N i) (= M k))), 11557#(and (or (<= l M) (< k N) (<= (+ j 1) M)) (or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M)) (or (= l 0) (< k N) (<= (+ j 1) M) (not (<= (+ l 1) M)))), 11522#(or (= (select A l) (select B l)) (< j M)), 11555#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 11553#(or (= (select A l) (select B l)) (< j M) (< k N)), 11558#(and (or (<= j i) (< k N) (<= M i)) (or (not (= M i)) (<= l M) (< k N)) (or (not (= M i)) (= M l) (= l 0) (<= j 1) (< k N)) (or (not (= M i)) (= M l) (= l 0) (not (<= l 0)) (< k N)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (not (= l 0))) (or (< i (+ M 1)) (< k N) (<= N (+ M 1))))] [2022-03-15 22:15:15,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:15:15,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:15:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:15:15,735 INFO L87 Difference]: Start difference. First operand 259 states and 898 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:17,981 INFO L93 Difference]: Finished difference Result 443 states and 1384 transitions. [2022-03-15 22:15:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:15:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:17,984 INFO L225 Difference]: With dead ends: 443 [2022-03-15 22:15:17,984 INFO L226 Difference]: Without dead ends: 437 [2022-03-15 22:15:17,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=427, Invalid=2879, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:15:17,985 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:17,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-03-15 22:15:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 262. [2022-03-15 22:15:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.478927203065134) internal successors, (908), 261 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 908 transitions. [2022-03-15 22:15:17,990 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 908 transitions. Word has length 15 [2022-03-15 22:15:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:17,990 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 908 transitions. [2022-03-15 22:15:17,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 908 transitions. [2022-03-15 22:15:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:17,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:17,991 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:18,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:18,213 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 22:15:18,213 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -999744554, now seen corresponding path program 8 times [2022-03-15 22:15:18,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:18,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65320497] [2022-03-15 22:15:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:18,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:18,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65320497] [2022-03-15 22:15:18,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65320497] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:18,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4663623] [2022-03-15 22:15:18,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:18,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:18,490 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:18,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:15:18,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:18,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:18,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:15:18,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:18,595 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 8 treesize of output 7 [2022-03-15 22:15:18,638 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:15:18,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:15:18,734 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 22:15:18,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:18,789 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:15:18,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 26 [2022-03-15 22:15:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:18,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4663623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:18,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:18,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-03-15 22:15:18,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [813437696] [2022-03-15 22:15:18,866 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:18,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:18,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2022-03-15 22:15:18,870 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:19,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [12686#(or (= (select A l) (select B l)) (< j M)), 12693#(and (or (= (+ l (* (- 1) M)) 0) (= l 0) (< k N) (< 0 l)) (or (= l 0) (<= l M) (< k N)) (or (= (+ l (* (- 1) M)) 0) (= j 0) (< k N)) (or (not (= l j)) (< k N) (not (= (+ l (* (- 1) M)) 0))) (or (= (select A l) (select B l)) (< k N) (not (= (+ l (* (- 1) M)) 0)))), 12687#(or (= (select A l) (select B l)) (< k N)), 12692#(and (or (= l 0) (<= l M) (< k N)) (or (= l 0) (not (<= l 0)) (< k N) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= l 0))) (or (= l 0) (<= j 1) (< k N) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= (+ l (* (- 1) M)) 0)))), 12690#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (= l j)), 12688#(or (= (select A l) (select B l)) (< j M) (< k N)), 12689#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (not (= (+ l (* (- 1) M)) 0)) (<= M i) (not (= k j))) (or (<= (+ l 1) N) (<= N i) (= l 0) (<= l M)) (or (<= N i) (not (= (+ i 1) j)) (not (= (+ l (* (- 1) M)) 0))) (or (<= N i) (= (+ l (* (- 1) M)) 0) (= j 0)) (or (<= N i) (= l 0) (< 0 l) (< M (+ l 1)))), 12691#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j))] [2022-03-15 22:15:19,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:15:19,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:15:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:15:19,479 INFO L87 Difference]: Start difference. First operand 262 states and 908 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:22,978 INFO L93 Difference]: Finished difference Result 502 states and 1552 transitions. [2022-03-15 22:15:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:15:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:22,981 INFO L225 Difference]: With dead ends: 502 [2022-03-15 22:15:22,981 INFO L226 Difference]: Without dead ends: 482 [2022-03-15 22:15:22,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=674, Invalid=3748, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:15:22,982 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:22,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:15:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-03-15 22:15:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 282. [2022-03-15 22:15:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 3.505338078291815) internal successors, (985), 281 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 985 transitions. [2022-03-15 22:15:22,988 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 985 transitions. Word has length 15 [2022-03-15 22:15:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:22,988 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 985 transitions. [2022-03-15 22:15:22,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 985 transitions. [2022-03-15 22:15:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:22,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:22,989 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:23,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 22:15:23,207 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 22:15:23,207 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash -955977514, now seen corresponding path program 9 times [2022-03-15 22:15:23,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:23,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845706017] [2022-03-15 22:15:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:23,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:23,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845706017] [2022-03-15 22:15:23,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845706017] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:23,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580850186] [2022-03-15 22:15:23,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:23,494 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:23,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:15:23,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:15:23,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:23,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 22:15:23,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:23,596 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 8 treesize of output 7 [2022-03-15 22:15:23,640 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 22:15:23,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-03-15 22:15:23,899 INFO L353 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-03-15 22:15:23,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-03-15 22:15:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:24,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:24,305 INFO L353 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-03-15 22:15:24,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 34 [2022-03-15 22:15:24,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:24,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 22:15:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:24,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580850186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:24,444 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:24,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-03-15 22:15:24,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426563742] [2022-03-15 22:15:24,444 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:24,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:24,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:15:24,447 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:25,296 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [13959#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (< j M)))), 13951#(or (= (select A l) (select B l)) (< i N)), 13955#(and (or (= l k) (= l 0) (not (< i N)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (= l k) (not (< i N)) (<= (+ 2 i) N) (= l i))), 13950#(or (= (select A l) (select B l)) (< j M)), 13954#(and (or (= (select A l) (select B l)) (= l k) (< j M) (< i N)) (or (= l k) (< j M) (= l 0) (< i N))), 13952#(or (= (select A l) (select B l)) (< j M) (< i N)), 13957#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (not (< (+ i 1) N)) (= l i) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= l k) (not (< (+ i 1) N)) (= l 0))), 13958#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (not (< (+ i 1) N)) (< j M) (= l i) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= l k) (not (< (+ i 1) N)) (< j M) (= l 0))), 13953#(and (or (= (select A l) (select B l)) (= l k) (< j M)) (or (= l k) (< j M) (= l 0))), 13956#(and (or (= l k) (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (= l k) (< j M) (not (< i N)) (<= (+ 2 i) N) (= l i)))] [2022-03-15 22:15:25,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:15:25,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:15:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:15:25,297 INFO L87 Difference]: Start difference. First operand 282 states and 985 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:26,092 INFO L93 Difference]: Finished difference Result 482 states and 1512 transitions. [2022-03-15 22:15:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 22:15:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:26,094 INFO L225 Difference]: With dead ends: 482 [2022-03-15 22:15:26,094 INFO L226 Difference]: Without dead ends: 410 [2022-03-15 22:15:26,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:15:26,095 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:26,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-03-15 22:15:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 258. [2022-03-15 22:15:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 3.4513618677042803) internal successors, (887), 257 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 887 transitions. [2022-03-15 22:15:26,100 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 887 transitions. Word has length 15 [2022-03-15 22:15:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:26,100 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 887 transitions. [2022-03-15 22:15:26,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 887 transitions. [2022-03-15 22:15:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:26,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:26,101 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:26,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:26,317 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 22:15:26,317 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2017178724, now seen corresponding path program 10 times [2022-03-15 22:15:26,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:26,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206133163] [2022-03-15 22:15:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:26,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:26,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206133163] [2022-03-15 22:15:26,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206133163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:26,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872609722] [2022-03-15 22:15:26,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:15:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:26,559 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:26,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:15:26,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:15:26,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:26,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:15:26,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:26,662 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 22:15:26,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:26,759 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 18 treesize of output 20 [2022-03-15 22:15:26,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:26,807 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 20 treesize of output 22 [2022-03-15 22:15:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:26,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:26,959 INFO L353 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-03-15 22:15:26,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-03-15 22:15:26,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:26,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 22:15:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:27,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872609722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:27,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:27,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:27,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83331474] [2022-03-15 22:15:27,098 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:27,099 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:27,101 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2022-03-15 22:15:27,101 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:27,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [15082#(or (= (select A l) (select B l)) (< j M)), 15088#(and (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (= l i)) (or (<= (+ 2 k) N) (< j M) (= l 0) (= l i)) (or (<= (+ 2 k) N) (< j M) (not (= l k)) (= l i))), 15089#(and (or (<= (+ 2 k) N) (< j M) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (not (< i N)) (= l i) (= (+ i 1) l)) (or (<= (+ 2 k) N) (< j M) (= l 0) (not (< i N)) (= (+ i 1) l))), 15083#(and (or (= (select A l) (select B l)) (< j M) (= l i)) (or (< j M) (= l 0) (= l i))), 15090#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (not (= l k)) (= (+ i 1) l)) (or (< (+ j 1) M) (<= (+ 2 k) N) (= l 0) (not (< i N)) (not (< j M)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l))), 15086#(or (= (select A l) (select B l)) (< j M) (< k N)), 15084#(or (= (select A l) (select B l)) (< k N)), 15087#(and (or (= (select A l) (select B l)) (< j M) (< k N) (= l i)) (or (< j M) (= l 0) (< k N) (= l i))), 15085#(and (or (<= (+ 2 k) N) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) N) (not (< i N)) (= l i) (= (+ i 1) l)) (or (<= (+ 2 k) N) (= l 0) (not (< i N)) (= (+ i 1) l)))] [2022-03-15 22:15:27,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:15:27,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:27,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:15:27,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:15:27,795 INFO L87 Difference]: Start difference. First operand 258 states and 887 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:29,021 INFO L93 Difference]: Finished difference Result 408 states and 1273 transitions. [2022-03-15 22:15:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:15:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:29,023 INFO L225 Difference]: With dead ends: 408 [2022-03-15 22:15:29,023 INFO L226 Difference]: Without dead ends: 397 [2022-03-15 22:15:29,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=338, Invalid=1918, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:15:29,024 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:29,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-03-15 22:15:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2022-03-15 22:15:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.4377358490566037) internal successors, (911), 265 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 911 transitions. [2022-03-15 22:15:29,029 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 911 transitions. Word has length 15 [2022-03-15 22:15:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:29,029 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 911 transitions. [2022-03-15 22:15:29,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 911 transitions. [2022-03-15 22:15:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:29,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:29,030 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:29,259 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 22:15:29,259 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -28876108, now seen corresponding path program 11 times [2022-03-15 22:15:29,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:29,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549765387] [2022-03-15 22:15:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:29,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:29,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549765387] [2022-03-15 22:15:29,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549765387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:29,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641937717] [2022-03-15 22:15:29,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:29,421 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:29,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:15:29,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:29,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:29,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:15:29,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:29,566 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 22:15:29,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:29,587 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 20 treesize of output 22 [2022-03-15 22:15:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:29,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:29,680 INFO L353 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2022-03-15 22:15:29,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 22 [2022-03-15 22:15:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:29,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641937717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:29,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:29,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 22:15:29,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25849028] [2022-03-15 22:15:29,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:29,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:29,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2022-03-15 22:15:29,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:30,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [16182#(and (or (< j M) (= i 0)) (or (<= (+ 3 i) N) (< j M) (= l 0) (< k N) (= (+ i 1) l)) (or (< j M) (<= 2 N))), 16183#(and (or (< j M) (= i 0)) (or (< j M) (<= 2 N)) (or (< 2 N) (<= (+ 2 k) N) (< j M) (= (+ (- 1) N) l) (= l i))), 16172#(or (= (select A l) (select B l)) (< j M)), 16173#(or (= (select A l) (select B l)) (< j M) (< i N)), 16174#(or (= (select A l) (select B l)) (< k N)), 16180#(and (or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)) (or (< j M) (= l 0) (< k N) (<= (+ 2 i) N) (= l i))), 16184#(and (or (< (+ j 1) M) (= i 0) (<= M j)) (or (< (+ j 1) M) (<= 2 N) (<= M j)) (or (< (+ j 1) M) (< 2 N) (<= (+ 2 k) N) (= (+ (- 1) N) l) (= l i) (<= M j))), 16177#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 16178#(and (or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (< k N) (<= (+ 2 i) N) (= l i))), 16181#(and (or (<= (+ 3 i) N) (< j M) (= l 0) (= (+ i 1) l)) (or (< j M) (= i 0)) (or (< j M) (<= 2 N))), 16176#(or (= (select A l) (select B l)) (< j M) (< k N)), 16179#(and (or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)) (or (< j M) (= l 0) (<= (+ 2 i) N) (= l i))), 16175#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N))] [2022-03-15 22:15:30,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:15:30,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:15:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:15:30,389 INFO L87 Difference]: Start difference. First operand 266 states and 911 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:31,243 INFO L93 Difference]: Finished difference Result 522 states and 1626 transitions. [2022-03-15 22:15:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 22:15:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:31,245 INFO L225 Difference]: With dead ends: 522 [2022-03-15 22:15:31,245 INFO L226 Difference]: Without dead ends: 480 [2022-03-15 22:15:31,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=632, Invalid=2560, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:15:31,246 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:31,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-03-15 22:15:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 284. [2022-03-15 22:15:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.462897526501767) internal successors, (980), 283 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 980 transitions. [2022-03-15 22:15:31,252 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 980 transitions. Word has length 15 [2022-03-15 22:15:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:31,252 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 980 transitions. [2022-03-15 22:15:31,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 980 transitions. [2022-03-15 22:15:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:31,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:31,253 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:31,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:31,460 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 22:15:31,460 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1619677280, now seen corresponding path program 9 times [2022-03-15 22:15:31,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:31,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140113694] [2022-03-15 22:15:31,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:31,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:31,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:31,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140113694] [2022-03-15 22:15:31,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140113694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:31,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485360718] [2022-03-15 22:15:31,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:31,612 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:31,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:15:31,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:15:31,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:31,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 22:15:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:31,734 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 8 treesize of output 7 [2022-03-15 22:15:31,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:31,755 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 14 treesize of output 16 [2022-03-15 22:15:31,804 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:15:31,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:15:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:31,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:31,937 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:15:31,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2022-03-15 22:15:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:32,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485360718] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:32,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:32,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:32,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132961930] [2022-03-15 22:15:32,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:32,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:32,039 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2022-03-15 22:15:32,039 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:32,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17423#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:15:32,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:15:32,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:15:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:15:32,386 INFO L87 Difference]: Start difference. First operand 284 states and 980 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 22:15:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:32,653 INFO L93 Difference]: Finished difference Result 444 states and 1489 transitions. [2022-03-15 22:15:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:15:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 15 [2022-03-15 22:15:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:32,655 INFO L225 Difference]: With dead ends: 444 [2022-03-15 22:15:32,655 INFO L226 Difference]: Without dead ends: 414 [2022-03-15 22:15:32,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:15:32,656 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:32,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:15:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-03-15 22:15:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 301. [2022-03-15 22:15:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.5033333333333334) internal successors, (1051), 300 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 1051 transitions. [2022-03-15 22:15:32,666 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 1051 transitions. Word has length 15 [2022-03-15 22:15:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:32,666 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 1051 transitions. [2022-03-15 22:15:32,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 22:15:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 1051 transitions. [2022-03-15 22:15:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:32,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:32,667 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:32,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:32,890 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 22:15:32,890 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash -705969504, now seen corresponding path program 10 times [2022-03-15 22:15:32,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:32,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449601000] [2022-03-15 22:15:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:33,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:33,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449601000] [2022-03-15 22:15:33,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449601000] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:33,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083950981] [2022-03-15 22:15:33,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:15:33,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:33,063 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:33,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:15:33,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:15:33,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:33,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:15:33,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:33,191 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 22:15:33,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:33,220 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 18 treesize of output 20 [2022-03-15 22:15:33,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:33,268 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 20 treesize of output 22 [2022-03-15 22:15:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:33,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:33,409 INFO L353 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-03-15 22:15:33,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-03-15 22:15:33,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:33,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 44 treesize of output 42 [2022-03-15 22:15:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:33,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083950981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:33,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:33,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 22:15:33,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579611572] [2022-03-15 22:15:33,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:33,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:33,524 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 48 transitions. [2022-03-15 22:15:33,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:34,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [18593#(or (= (select A l) (select B l)) (< k N)), 18591#(or (= (select A l) (select B l)) (< j M) (< i N)), 18599#(and (or (< j M) (<= (+ l 1) (+ N k))) (or (< j M) (<= k 0) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (<= 0 k)) (or (< j M) (= l 0) (not (<= l 0)))), 18597#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (<= l k))) (or (= l k) (< j M) (not (= k i)) (= l 0) (not (<= l k))) (or (< j M) (< i (+ k 1))) (or (< j M) (<= l k) (not (= k i)) (<= (+ l i 1) (+ N k)))), 18590#(or (= (select A l) (select B l)) (< j M)), 18598#(and (or (< j M) (= l 0) (not (<= (+ l 1) k))) (or (<= (+ 2 l) (+ N k)) (< j M) (<= l k)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k))), 18592#(and (or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)) (or (< j M) (= l 0) (<= (+ 2 i) N) (= l i))), 18596#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 18595#(or (= (select A l) (select B l)) (< j M) (< k N)), 18594#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N))] [2022-03-15 22:15:34,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:15:34,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:15:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:15:34,057 INFO L87 Difference]: Start difference. First operand 301 states and 1051 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:35,016 INFO L93 Difference]: Finished difference Result 423 states and 1388 transitions. [2022-03-15 22:15:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:15:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:35,018 INFO L225 Difference]: With dead ends: 423 [2022-03-15 22:15:35,018 INFO L226 Difference]: Without dead ends: 403 [2022-03-15 22:15:35,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=565, Invalid=2191, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:15:35,018 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:35,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-03-15 22:15:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 314. [2022-03-15 22:15:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.498402555910543) internal successors, (1095), 313 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1095 transitions. [2022-03-15 22:15:35,024 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1095 transitions. Word has length 15 [2022-03-15 22:15:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:35,024 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 1095 transitions. [2022-03-15 22:15:35,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1095 transitions. [2022-03-15 22:15:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:15:35,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:35,025 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:35,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:35,243 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 22:15:35,243 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:35,244 INFO L85 PathProgramCache]: Analyzing trace with hash 739225982, now seen corresponding path program 11 times [2022-03-15 22:15:35,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:35,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404268431] [2022-03-15 22:15:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:35,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:35,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404268431] [2022-03-15 22:15:35,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404268431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:35,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138270099] [2022-03-15 22:15:35,428 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:35,432 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:35,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:15:35,461 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:35,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:35,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:15:35,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:35,596 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 22:15:35,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:35,618 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 20 treesize of output 22 [2022-03-15 22:15:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:35,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:35,704 INFO L353 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2022-03-15 22:15:35,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 22 [2022-03-15 22:15:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:35,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138270099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:35,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:35,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 22:15:35,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29279892] [2022-03-15 22:15:35,811 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:35,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:35,813 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2022-03-15 22:15:35,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:36,462 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [19804#(and (or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (< k N) (<= (+ 2 i) N) (= l i))), 19812#(and (or (<= (+ l 1) N) (< j M)) (or (< j M) (<= k 0) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (= l 0) (< 0 l)) (or (< j M) (<= 0 k))), 19801#(or (= (select A l) (select B l)) (< k N)), 19800#(or (= (select A l) (select B l)) (< j M)), 19809#(and (or (<= (+ 3 i) N) (< j M) (= l 0) (= (+ i 1) l)) (or (< j M) (= i 0)) (or (< j M) (<= 2 N))), 19803#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 19808#(and (or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)) (or (< j M) (= l 0) (< k N) (<= (+ 2 i) N) (= l i))), 19802#(or (= (select A l) (select B l)) (< j M) (< k N)), 19806#(and (or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)) (or (< j M) (= l 0) (<= (+ 2 i) N) (= l i))), 19805#(or (= (select A l) (select B l)) (< j M) (< i N)), 19807#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 19810#(and (or (< j M) (= i 0)) (or (<= (+ 3 i) N) (< j M) (= l 0) (< k N) (= (+ i 1) l)) (or (< j M) (<= 2 N))), 19811#(and (or (< j M) (= l 0) (not (<= (+ l 1) k))) (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (<= (+ l 1) N) (< j M) (<= l k)))] [2022-03-15 22:15:36,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:15:36,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:15:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:15:36,463 INFO L87 Difference]: Start difference. First operand 314 states and 1095 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:37,256 INFO L93 Difference]: Finished difference Result 415 states and 1382 transitions. [2022-03-15 22:15:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 22:15:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:15:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:37,258 INFO L225 Difference]: With dead ends: 415 [2022-03-15 22:15:37,258 INFO L226 Difference]: Without dead ends: 408 [2022-03-15 22:15:37,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=482, Invalid=2170, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:15:37,259 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:37,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-03-15 22:15:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 317. [2022-03-15 22:15:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.5348101265822787) internal successors, (1117), 316 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1117 transitions. [2022-03-15 22:15:37,264 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1117 transitions. Word has length 15 [2022-03-15 22:15:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:37,264 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1117 transitions. [2022-03-15 22:15:37,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1117 transitions. [2022-03-15 22:15:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:37,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:37,265 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:37,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:37,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:37,480 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1943968970, now seen corresponding path program 12 times [2022-03-15 22:15:37,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:37,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653345639] [2022-03-15 22:15:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:37,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:37,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653345639] [2022-03-15 22:15:37,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653345639] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:37,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524706238] [2022-03-15 22:15:37,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:15:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:37,538 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:37,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:15:37,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:15:37,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:37,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:37,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:37,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:37,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524706238] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:37,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:37,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:15:37,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574045984] [2022-03-15 22:15:37,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:37,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:37,738 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 78 transitions. [2022-03-15 22:15:37,738 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:38,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [21011#(or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 21014#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 21007#(or (<= (+ k 1) N) (< j M)), 21013#(and (or (<= N (+ i 1)) (<= (+ 3 j) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 21003#(< j M), 20980#(or (<= (+ 2 k) N) (< j M)), 21005#(or (< j M) (< i N)), 21009#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 21004#(< i N), 21010#(or (< (+ j 1) M) (<= N i) (<= (+ 2 k) N) (<= M j)), 21006#(or (< k N) (< i N)), 21008#(or (< j M) (< k N) (< i N)), 21015#(and (or (<= N (+ 2 i)) (<= (+ 3 j) N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 21012#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 3 j) N)))] [2022-03-15 22:15:38,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:15:38,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:15:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:15:38,178 INFO L87 Difference]: Start difference. First operand 317 states and 1117 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:39,584 INFO L93 Difference]: Finished difference Result 931 states and 2763 transitions. [2022-03-15 22:15:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 22:15:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:39,587 INFO L225 Difference]: With dead ends: 931 [2022-03-15 22:15:39,587 INFO L226 Difference]: Without dead ends: 931 [2022-03-15 22:15:39,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1534, Invalid=5776, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 22:15:39,588 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:39,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:15:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-03-15 22:15:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 370. [2022-03-15 22:15:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 3.758807588075881) internal successors, (1387), 369 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1387 transitions. [2022-03-15 22:15:39,605 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1387 transitions. Word has length 16 [2022-03-15 22:15:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:39,605 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 1387 transitions. [2022-03-15 22:15:39,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1387 transitions. [2022-03-15 22:15:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:39,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:39,610 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:39,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:39,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:39,810 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1877834972, now seen corresponding path program 13 times [2022-03-15 22:15:39,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:39,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347807515] [2022-03-15 22:15:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:39,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:39,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347807515] [2022-03-15 22:15:39,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347807515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:39,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189362509] [2022-03-15 22:15:39,889 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:15:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:39,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:39,890 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:39,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:15:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:39,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:39,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:40,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:40,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189362509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:40,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:40,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:15:40,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [855773989] [2022-03-15 22:15:40,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:40,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:40,093 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2022-03-15 22:15:40,093 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:40,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [22913#(or (< k N) (<= (+ j 1) M)), 22915#(or (<= (+ 2 k j) (+ N M)) (< i N)), 22906#(and (or (<= N (+ i 1)) (<= (+ 3 j) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 22908#(< i N), 22909#(or (<= (+ j 1) M) (< i N)), 22907#(and (or (<= N (+ 2 i)) (<= (+ 3 j) N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 22905#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 3 j) N))), 22914#(or (< j M) (< k N) (< i N)), 22912#(or (< k N) (< i N)), 22911#(< k N), 22910#(or (<= (+ 2 j) M) (< i N))] [2022-03-15 22:15:40,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:15:40,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:40,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:15:40,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:15:40,421 INFO L87 Difference]: Start difference. First operand 370 states and 1387 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:40,888 INFO L93 Difference]: Finished difference Result 670 states and 2138 transitions. [2022-03-15 22:15:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 22:15:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:40,891 INFO L225 Difference]: With dead ends: 670 [2022-03-15 22:15:40,891 INFO L226 Difference]: Without dead ends: 670 [2022-03-15 22:15:40,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:15:40,891 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:40,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-15 22:15:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 370. [2022-03-15 22:15:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 3.758807588075881) internal successors, (1387), 369 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1387 transitions. [2022-03-15 22:15:40,899 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1387 transitions. Word has length 16 [2022-03-15 22:15:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:40,899 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 1387 transitions. [2022-03-15 22:15:40,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1387 transitions. [2022-03-15 22:15:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:40,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:40,900 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:40,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:41,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 22:15:41,118 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -334292830, now seen corresponding path program 14 times [2022-03-15 22:15:41,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:41,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211267031] [2022-03-15 22:15:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:41,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:41,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211267031] [2022-03-15 22:15:41,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211267031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:41,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780096474] [2022-03-15 22:15:41,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:41,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:41,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:41,176 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:41,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 22:15:41,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:41,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:41,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:41,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:41,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:41,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780096474] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:41,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:41,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2022-03-15 22:15:41,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [469721472] [2022-03-15 22:15:41,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:41,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:41,352 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 72 transitions. [2022-03-15 22:15:41,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:41,723 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [24472#(or (< j M) (< k N) (< i N)), 24474#(or (<= N i) (<= (+ 2 k) N)), 24479#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ j 1) i))), 24467#(< i N), 24470#(or (< k N) (< i N)), 24469#(or (< j M) (< i N)), 24480#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= j i))), 24473#(or (<= (+ 2 k) N) (< j M)), 24475#(or (<= N i) (<= (+ 2 k) N) (< j M)), 24478#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 24477#(or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 24468#(< j M), 24471#(or (<= (+ k 1) N) (< j M)), 24476#(or (< (+ j 1) M) (<= N i) (<= (+ 2 k) N) (<= M j))] [2022-03-15 22:15:41,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:15:41,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:15:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:15:41,724 INFO L87 Difference]: Start difference. First operand 370 states and 1387 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:42,630 INFO L93 Difference]: Finished difference Result 969 states and 2995 transitions. [2022-03-15 22:15:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 22:15:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:42,643 INFO L225 Difference]: With dead ends: 969 [2022-03-15 22:15:42,643 INFO L226 Difference]: Without dead ends: 969 [2022-03-15 22:15:42,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=922, Invalid=3238, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:15:42,644 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:42,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-03-15 22:15:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 397. [2022-03-15 22:15:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.8661616161616164) internal successors, (1531), 396 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1531 transitions. [2022-03-15 22:15:42,653 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1531 transitions. Word has length 16 [2022-03-15 22:15:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:42,653 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 1531 transitions. [2022-03-15 22:15:42,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1531 transitions. [2022-03-15 22:15:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:42,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:42,655 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:42,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:42,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:15:42,868 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1288532298, now seen corresponding path program 15 times [2022-03-15 22:15:42,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:42,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210956221] [2022-03-15 22:15:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:42,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:42,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210956221] [2022-03-15 22:15:42,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210956221] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:42,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991551968] [2022-03-15 22:15:42,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:42,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:42,918 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:42,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 22:15:42,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:15:42,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:42,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:42,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:43,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:43,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991551968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:43,066 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:43,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2022-03-15 22:15:43,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666980514] [2022-03-15 22:15:43,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:43,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:43,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 55 transitions. [2022-03-15 22:15:43,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:43,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [26402#(or (< j M) (<= (+ k 1) i)), 26424#(or (< j M) (< k N)), 26428#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ j 1) i))), 26430#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= j i))), 26422#(or (<= N i) (< j M)), 26429#(or (<= N (+ i 1)) (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 26426#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 26427#(or (< (+ j 1) M) (<= N i) (<= k i) (<= M j)), 26423#(< k N), 26425#(or (<= k i) (< j M)), 26421#(< j M)] [2022-03-15 22:15:43,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:15:43,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:43,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:15:43,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:43,315 INFO L87 Difference]: Start difference. First operand 397 states and 1531 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:44,287 INFO L93 Difference]: Finished difference Result 811 states and 2625 transitions. [2022-03-15 22:15:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 22:15:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:44,291 INFO L225 Difference]: With dead ends: 811 [2022-03-15 22:15:44,291 INFO L226 Difference]: Without dead ends: 809 [2022-03-15 22:15:44,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=994, Invalid=3296, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:15:44,292 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:44,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-03-15 22:15:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 378. [2022-03-15 22:15:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.848806366047745) internal successors, (1451), 377 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1451 transitions. [2022-03-15 22:15:44,300 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1451 transitions. Word has length 16 [2022-03-15 22:15:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:44,300 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 1451 transitions. [2022-03-15 22:15:44,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1451 transitions. [2022-03-15 22:15:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:44,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:44,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:44,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:44,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 22:15:44,502 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 754020313, now seen corresponding path program 16 times [2022-03-15 22:15:44,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:44,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678557044] [2022-03-15 22:15:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:44,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:44,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678557044] [2022-03-15 22:15:44,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678557044] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:44,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599971063] [2022-03-15 22:15:44,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:15:44,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:44,539 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:44,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 22:15:44,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:15:44,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:44,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:15:44,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:44,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:44,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599971063] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:44,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:44,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 22:15:44,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469245157] [2022-03-15 22:15:44,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:44,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:44,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 83 transitions. [2022-03-15 22:15:44,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:44,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [28188#(or (< (+ 2 j) M) (<= M (+ j 1))), 28185#(or (< j M) (< i N)), 28190#(or (<= N (+ i 1)) (<= (+ M i 1) (+ N j))), 28183#(< j M), 28184#(< i N), 28186#(or (< (+ j 1) M) (<= M j)), 28187#(or (< i N) (<= M j)), 28189#(or (<= N i) (<= (+ M i) (+ N j)))] [2022-03-15 22:15:44,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:15:44,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:44,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:15:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:15:44,879 INFO L87 Difference]: Start difference. First operand 378 states and 1451 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:45,061 INFO L93 Difference]: Finished difference Result 691 states and 2467 transitions. [2022-03-15 22:15:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:15:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:45,064 INFO L225 Difference]: With dead ends: 691 [2022-03-15 22:15:45,064 INFO L226 Difference]: Without dead ends: 670 [2022-03-15 22:15:45,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:15:45,065 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:45,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:15:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-15 22:15:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 477. [2022-03-15 22:15:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.9705882352941178) internal successors, (1890), 476 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1890 transitions. [2022-03-15 22:15:45,073 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1890 transitions. Word has length 16 [2022-03-15 22:15:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:45,073 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 1890 transitions. [2022-03-15 22:15:45,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1890 transitions. [2022-03-15 22:15:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:45,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:45,074 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:45,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:45,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 22:15:45,279 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1835931461, now seen corresponding path program 17 times [2022-03-15 22:15:45,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:45,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124574857] [2022-03-15 22:15:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:45,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:45,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:45,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124574857] [2022-03-15 22:15:45,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124574857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:45,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714731457] [2022-03-15 22:15:45,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:45,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:45,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:45,344 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:45,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 22:15:45,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:15:45,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:45,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:45,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:45,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:45,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714731457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:45,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:45,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:15:45,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266025373] [2022-03-15 22:15:45,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:45,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:45,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 68 transitions. [2022-03-15 22:15:45,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:45,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [29970#(or (<= (+ N M) (+ k j 1)) (< i N)), 29965#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= i j))), 29966#(< j M), 29969#(or (< j M) (< i N)), 29968#(or (<= N k) (< i N)), 29967#(< i N), 29964#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i (+ j 1))))] [2022-03-15 22:15:45,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:15:45,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:15:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:45,785 INFO L87 Difference]: Start difference. First operand 477 states and 1890 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:46,218 INFO L93 Difference]: Finished difference Result 741 states and 2602 transitions. [2022-03-15 22:15:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:15:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:46,222 INFO L225 Difference]: With dead ends: 741 [2022-03-15 22:15:46,222 INFO L226 Difference]: Without dead ends: 731 [2022-03-15 22:15:46,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:15:46,222 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:46,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-03-15 22:15:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 493. [2022-03-15 22:15:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 3.9857723577235773) internal successors, (1961), 492 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1961 transitions. [2022-03-15 22:15:46,232 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1961 transitions. Word has length 16 [2022-03-15 22:15:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:46,232 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 1961 transitions. [2022-03-15 22:15:46,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1961 transitions. [2022-03-15 22:15:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:46,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:46,233 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:46,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:46,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:46,434 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1848744349, now seen corresponding path program 18 times [2022-03-15 22:15:46,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:46,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194332113] [2022-03-15 22:15:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:46,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:46,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194332113] [2022-03-15 22:15:46,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194332113] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:46,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697453562] [2022-03-15 22:15:46,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:15:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:46,568 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:46,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 22:15:46,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:15:46,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:46,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:46,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:46,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697453562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:46,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:46,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:15:46,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508881074] [2022-03-15 22:15:46,768 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:46,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:46,771 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2022-03-15 22:15:46,771 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:46,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [31843#(or (<= (+ N M) (+ k j 1)) (< i N)), 31842#(or (< i N) (<= M j)), 31840#(< i N), 31844#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= i j))), 31841#(or (< k N) (< i N)), 31838#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i (+ j 1)))), 31839#(< k N)] [2022-03-15 22:15:46,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:15:46,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:15:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:46,994 INFO L87 Difference]: Start difference. First operand 493 states and 1961 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:47,624 INFO L93 Difference]: Finished difference Result 778 states and 2718 transitions. [2022-03-15 22:15:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 22:15:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:47,628 INFO L225 Difference]: With dead ends: 778 [2022-03-15 22:15:47,628 INFO L226 Difference]: Without dead ends: 762 [2022-03-15 22:15:47,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=596, Invalid=2056, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:15:47,629 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:47,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-03-15 22:15:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 487. [2022-03-15 22:15:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 4.010288065843621) internal successors, (1949), 486 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1949 transitions. [2022-03-15 22:15:47,639 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1949 transitions. Word has length 16 [2022-03-15 22:15:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:47,639 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 1949 transitions. [2022-03-15 22:15:47,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1949 transitions. [2022-03-15 22:15:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:47,640 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:47,640 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:47,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:47,855 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1515684849, now seen corresponding path program 19 times [2022-03-15 22:15:47,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:47,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447607278] [2022-03-15 22:15:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:47,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:47,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447607278] [2022-03-15 22:15:47,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447607278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:47,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245835953] [2022-03-15 22:15:47,884 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:15:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:47,885 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:47,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 22:15:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:47,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:15:47,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:47,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:48,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245835953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:48,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:48,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-15 22:15:48,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950687313] [2022-03-15 22:15:48,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:48,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:48,011 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 53 transitions. [2022-03-15 22:15:48,011 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:48,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [33754#(or (< j M) (< i N)), 33757#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 33758#(or (<= (+ 3 i) N) (<= N i) (< (+ 2 j) M) (<= M (+ j 1))), 33755#(or (< j M) (<= (+ 2 i) N)), 33753#(< j M), 33759#(or (<= N i) (<= (+ M i 1) (+ N j))), 33756#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j))] [2022-03-15 22:15:48,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:15:48,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:15:48,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:15:48,177 INFO L87 Difference]: Start difference. First operand 487 states and 1949 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:48,315 INFO L93 Difference]: Finished difference Result 719 states and 2527 transitions. [2022-03-15 22:15:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:15:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:48,319 INFO L225 Difference]: With dead ends: 719 [2022-03-15 22:15:48,319 INFO L226 Difference]: Without dead ends: 719 [2022-03-15 22:15:48,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:48,319 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:48,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:15:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-03-15 22:15:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 486. [2022-03-15 22:15:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 4.020618556701031) internal successors, (1950), 485 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1950 transitions. [2022-03-15 22:15:48,328 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1950 transitions. Word has length 16 [2022-03-15 22:15:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:48,329 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 1950 transitions. [2022-03-15 22:15:48,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1950 transitions. [2022-03-15 22:15:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:48,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:48,330 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:48,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 22:15:48,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 22:15:48,545 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 3455429, now seen corresponding path program 20 times [2022-03-15 22:15:48,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:48,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430969626] [2022-03-15 22:15:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:48,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:48,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430969626] [2022-03-15 22:15:48,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430969626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:48,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739910965] [2022-03-15 22:15:48,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:48,594 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:48,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 22:15:48,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:48,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:48,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:48,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:48,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:48,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739910965] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:48,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:48,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-03-15 22:15:48,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540346692] [2022-03-15 22:15:48,717 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:48,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:48,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 60 transitions. [2022-03-15 22:15:48,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:48,925 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [35566#(< j M), 35570#(or (<= (+ i 1) k) (< j M)), 35572#(or (< (+ j 1) M) (<= (+ i 1) k) (<= N i) (<= M j)), 35573#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 35569#(or (< j M) (<= i k)), 35571#(or (< (+ j 1) M) (<= i k) (<= M j)), 35567#(or (< j M) (< i N)), 35568#(or (< j M) (<= N k)), 35565#(< i N)] [2022-03-15 22:15:48,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:15:48,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:15:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:15:48,926 INFO L87 Difference]: Start difference. First operand 486 states and 1950 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:49,567 INFO L93 Difference]: Finished difference Result 952 states and 3259 transitions. [2022-03-15 22:15:49,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:15:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:49,571 INFO L225 Difference]: With dead ends: 952 [2022-03-15 22:15:49,571 INFO L226 Difference]: Without dead ends: 937 [2022-03-15 22:15:49,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:15:49,580 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:49,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-03-15 22:15:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 544. [2022-03-15 22:15:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 4.1031307550644565) internal successors, (2228), 543 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 2228 transitions. [2022-03-15 22:15:49,591 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 2228 transitions. Word has length 16 [2022-03-15 22:15:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:49,591 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 2228 transitions. [2022-03-15 22:15:49,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 2228 transitions. [2022-03-15 22:15:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:49,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:49,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:49,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:49,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:49,808 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1972775941, now seen corresponding path program 21 times [2022-03-15 22:15:49,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:49,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492071415] [2022-03-15 22:15:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:49,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:49,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492071415] [2022-03-15 22:15:49,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492071415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:49,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564687579] [2022-03-15 22:15:49,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:49,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:49,877 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:49,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 22:15:49,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:15:49,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:49,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:49,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:49,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:50,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564687579] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:50,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:50,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-15 22:15:50,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277112398] [2022-03-15 22:15:50,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:50,047 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:50,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 53 transitions. [2022-03-15 22:15:50,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:50,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [37783#(or (< (+ j 1) M) (<= (+ i 1) k) (<= N i) (<= M j)), 37780#(or (<= (+ i 1) k) (< j M)), 37784#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 37774#(or (< k N) (< i N)), 37778#(or (< j M) (< k N) (< i N)), 37782#(or (< (+ j 1) M) (<= i k) (<= M j)), 37775#(< j M), 37776#(or (< j M) (< k N)), 37779#(or (< j M) (<= (+ 2 i) N)), 37773#(< k N), 37777#(or (< j M) (< i N)), 37781#(or (< j M) (<= i k))] [2022-03-15 22:15:50,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:15:50,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:15:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:50,290 INFO L87 Difference]: Start difference. First operand 544 states and 2228 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:51,178 INFO L93 Difference]: Finished difference Result 1350 states and 4612 transitions. [2022-03-15 22:15:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:15:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:51,182 INFO L225 Difference]: With dead ends: 1350 [2022-03-15 22:15:51,182 INFO L226 Difference]: Without dead ends: 1344 [2022-03-15 22:15:51,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=2577, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:15:51,182 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:51,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:15:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-03-15 22:15:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 599. [2022-03-15 22:15:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 4.183946488294314) internal successors, (2502), 598 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 2502 transitions. [2022-03-15 22:15:51,196 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 2502 transitions. Word has length 16 [2022-03-15 22:15:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:51,196 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 2502 transitions. [2022-03-15 22:15:51,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 2502 transitions. [2022-03-15 22:15:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:51,198 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:51,198 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:51,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:51,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:51,406 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2058572226, now seen corresponding path program 12 times [2022-03-15 22:15:51,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:51,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337181623] [2022-03-15 22:15:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:51,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:51,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337181623] [2022-03-15 22:15:51,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337181623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:51,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563544465] [2022-03-15 22:15:51,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:15:51,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:51,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:51,443 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:51,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 22:15:51,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:15:51,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:51,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:51,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:51,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:51,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563544465] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:51,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:51,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:15:51,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277127800] [2022-03-15 22:15:51,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:51,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:51,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 72 transitions. [2022-03-15 22:15:51,576 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:51,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [40504#(or (< j M) (< i N)), 40502#(< i N), 40500#(or (<= (+ k 1) N) (< j M)), 40503#(or (< k N) (< i N)), 40508#(or (<= N i) (< j M) (<= (+ k 1) i)), 40512#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 40505#(or (< j M) (< k N) (< i N)), 40510#(or (<= N i) (<= k i)), 40488#(or (< j M) (<= (+ k 1) i)), 40507#(or (<= N i) (<= (+ k 1) i)), 40509#(or (<= N (+ i 1)) (<= k i)), 40511#(or (<= N (+ i 1)) (<= k i) (< j M)), 40506#(or (<= (+ 2 k) i) (< j M)), 40501#(or (<= (+ 2 k) N) (< j M)), 40499#(< j M)] [2022-03-15 22:15:51,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:15:51,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:51,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:15:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:15:51,901 INFO L87 Difference]: Start difference. First operand 599 states and 2502 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:52,449 INFO L93 Difference]: Finished difference Result 928 states and 3489 transitions. [2022-03-15 22:15:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 22:15:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:52,452 INFO L225 Difference]: With dead ends: 928 [2022-03-15 22:15:52,452 INFO L226 Difference]: Without dead ends: 928 [2022-03-15 22:15:52,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=508, Invalid=1654, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:15:52,452 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:52,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-03-15 22:15:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 659. [2022-03-15 22:15:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 4.21580547112462) internal successors, (2774), 658 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2774 transitions. [2022-03-15 22:15:52,464 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 2774 transitions. Word has length 16 [2022-03-15 22:15:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:52,464 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 2774 transitions. [2022-03-15 22:15:52,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 2774 transitions. [2022-03-15 22:15:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:52,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:52,466 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:52,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 22:15:52,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 22:15:52,684 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash -267074558, now seen corresponding path program 13 times [2022-03-15 22:15:52,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:52,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628037065] [2022-03-15 22:15:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:52,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:52,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:52,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628037065] [2022-03-15 22:15:52,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628037065] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:52,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704521108] [2022-03-15 22:15:52,729 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:15:52,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:52,730 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:52,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 22:15:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:52,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:15:52,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:52,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:52,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704521108] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:52,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:52,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:15:52,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979770191] [2022-03-15 22:15:52,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:52,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:52,847 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 65 transitions. [2022-03-15 22:15:52,847 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:53,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [42903#(< j M), 42904#(< k N), 42906#(or (<= N i) (< j M)), 42899#(or (<= k i) (< j M)), 42911#(or (<= N i) (< j M) (<= (+ k 1) i)), 42909#(or (<= N (+ i 1)) (<= k i)), 42908#(or (<= N i) (<= (+ k 1) i)), 42910#(or (<= N i) (<= k i)), 42892#(or (< j M) (<= (+ k 1) i)), 42907#(or (<= (+ 2 k) i) (< j M)), 42913#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 42912#(or (<= N (+ i 1)) (<= k i) (< j M)), 42905#(or (< j M) (< k N))] [2022-03-15 22:15:53,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:15:53,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:15:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:15:53,088 INFO L87 Difference]: Start difference. First operand 659 states and 2774 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:53,617 INFO L93 Difference]: Finished difference Result 864 states and 3328 transitions. [2022-03-15 22:15:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 22:15:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:53,619 INFO L225 Difference]: With dead ends: 864 [2022-03-15 22:15:53,619 INFO L226 Difference]: Without dead ends: 863 [2022-03-15 22:15:53,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 22:15:53,620 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:53,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-03-15 22:15:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 644. [2022-03-15 22:15:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 4.228615863141524) internal successors, (2719), 643 states have internal predecessors, (2719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 2719 transitions. [2022-03-15 22:15:53,631 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 2719 transitions. Word has length 16 [2022-03-15 22:15:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:53,631 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 2719 transitions. [2022-03-15 22:15:53,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 2719 transitions. [2022-03-15 22:15:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:53,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:53,632 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:53,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:53,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 22:15:53,834 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -90856861, now seen corresponding path program 22 times [2022-03-15 22:15:53,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:53,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723064705] [2022-03-15 22:15:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:53,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:53,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723064705] [2022-03-15 22:15:53,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723064705] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:53,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252758505] [2022-03-15 22:15:53,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:15:53,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:53,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:53,875 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:53,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 22:15:53,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:15:53,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:53,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:53,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:53,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:54,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252758505] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:54,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:54,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-03-15 22:15:54,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054584522] [2022-03-15 22:15:54,031 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:54,031 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:54,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 54 transitions. [2022-03-15 22:15:54,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:54,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [45224#(< i N), 45227#(or (< j M) (<= N k)), 45225#(< j M), 45228#(or (<= (+ i 1) k) (<= N i)), 45223#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 45226#(or (< j M) (< i N))] [2022-03-15 22:15:54,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:15:54,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:15:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:15:54,175 INFO L87 Difference]: Start difference. First operand 644 states and 2719 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:54,650 INFO L93 Difference]: Finished difference Result 960 states and 3565 transitions. [2022-03-15 22:15:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:15:54,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:54,653 INFO L225 Difference]: With dead ends: 960 [2022-03-15 22:15:54,653 INFO L226 Difference]: Without dead ends: 952 [2022-03-15 22:15:54,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:15:54,654 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:54,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-03-15 22:15:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 614. [2022-03-15 22:15:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 4.181076672104404) internal successors, (2563), 613 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2563 transitions. [2022-03-15 22:15:54,671 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2563 transitions. Word has length 16 [2022-03-15 22:15:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:54,671 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 2563 transitions. [2022-03-15 22:15:54,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2563 transitions. [2022-03-15 22:15:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:54,672 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:54,672 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:54,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:54,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:15:54,873 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1671801147, now seen corresponding path program 23 times [2022-03-15 22:15:54,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:54,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115618581] [2022-03-15 22:15:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:54,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:54,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115618581] [2022-03-15 22:15:54,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115618581] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:54,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38095023] [2022-03-15 22:15:54,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:54,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:54,920 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:54,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 22:15:54,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:15:54,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:54,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:55,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:55,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38095023] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:55,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:55,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-03-15 22:15:55,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656495749] [2022-03-15 22:15:55,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:55,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:55,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 22:15:55,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:55,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [47569#(< j M), 47571#(or (< j M) (< i N)), 47572#(or (< j M) (< k N) (< i N)), 47567#(or (< k N) (< i N)), 47573#(or (< j M) (<= (+ 2 i) N)), 47570#(or (< j M) (< k N)), 47566#(< k N), 47568#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j)))] [2022-03-15 22:15:55,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:15:55,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:15:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:15:55,239 INFO L87 Difference]: Start difference. First operand 614 states and 2563 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:55,544 INFO L93 Difference]: Finished difference Result 822 states and 3123 transitions. [2022-03-15 22:15:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 22:15:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:55,546 INFO L225 Difference]: With dead ends: 822 [2022-03-15 22:15:55,546 INFO L226 Difference]: Without dead ends: 822 [2022-03-15 22:15:55,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:15:55,547 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:55,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-03-15 22:15:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 612. [2022-03-15 22:15:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 4.176759410801964) internal successors, (2552), 611 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2552 transitions. [2022-03-15 22:15:55,557 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 2552 transitions. Word has length 16 [2022-03-15 22:15:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:55,557 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 2552 transitions. [2022-03-15 22:15:55,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 2552 transitions. [2022-03-15 22:15:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:55,559 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:55,559 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:55,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:55,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:55,759 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 399359621, now seen corresponding path program 24 times [2022-03-15 22:15:55,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:55,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664092456] [2022-03-15 22:15:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:55,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:55,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664092456] [2022-03-15 22:15:55,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664092456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:55,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299388871] [2022-03-15 22:15:55,815 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:15:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:55,816 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:55,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 22:15:55,851 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:15:55,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:55,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:55,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:55,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:56,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299388871] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:56,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:56,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 15 [2022-03-15 22:15:56,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361612616] [2022-03-15 22:15:56,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:56,023 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:56,025 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 56 transitions. [2022-03-15 22:15:56,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:56,188 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [49754#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 49752#(< j M), 49753#(or (< j M) (<= N k)), 49757#(or (< j M) (< i N)), 49755#(or (< (+ j 1) M) (<= N k) (<= M j)), 49756#(< i N), 49758#(or (<= N k) (< i N))] [2022-03-15 22:15:56,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:15:56,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:56,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:15:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:15:56,189 INFO L87 Difference]: Start difference. First operand 612 states and 2552 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:56,796 INFO L93 Difference]: Finished difference Result 964 states and 3557 transitions. [2022-03-15 22:15:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:15:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:56,798 INFO L225 Difference]: With dead ends: 964 [2022-03-15 22:15:56,798 INFO L226 Difference]: Without dead ends: 959 [2022-03-15 22:15:56,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2143, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:15:56,799 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:56,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-15 22:15:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 645. [2022-03-15 22:15:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 4.222049689440993) internal successors, (2719), 644 states have internal predecessors, (2719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2719 transitions. [2022-03-15 22:15:56,811 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2719 transitions. Word has length 16 [2022-03-15 22:15:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:56,811 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 2719 transitions. [2022-03-15 22:15:56,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2719 transitions. [2022-03-15 22:15:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:56,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:56,813 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:56,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 22:15:57,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 22:15:57,021 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -670040609, now seen corresponding path program 25 times [2022-03-15 22:15:57,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:57,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655074463] [2022-03-15 22:15:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:57,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:57,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655074463] [2022-03-15 22:15:57,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655074463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:57,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255292342] [2022-03-15 22:15:57,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:15:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:57,070 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:57,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 22:15:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:57,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:57,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:57,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:15:57,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255292342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:57,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:57,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 15 [2022-03-15 22:15:57,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841441157] [2022-03-15 22:15:57,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:57,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:57,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 54 transitions. [2022-03-15 22:15:57,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:57,438 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [52181#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 52178#(< i N), 52177#(< k N), 52180#(or (< i N) (<= M j)), 52179#(or (< k N) (< i N))] [2022-03-15 22:15:57,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:15:57,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:15:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:15:57,439 INFO L87 Difference]: Start difference. First operand 645 states and 2719 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:57,900 INFO L93 Difference]: Finished difference Result 972 states and 3557 transitions. [2022-03-15 22:15:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:15:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:57,902 INFO L225 Difference]: With dead ends: 972 [2022-03-15 22:15:57,902 INFO L226 Difference]: Without dead ends: 954 [2022-03-15 22:15:57,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:15:57,903 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:57,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-03-15 22:15:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 629. [2022-03-15 22:15:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 4.226114649681529) internal successors, (2654), 628 states have internal predecessors, (2654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 2654 transitions. [2022-03-15 22:15:57,915 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 2654 transitions. Word has length 16 [2022-03-15 22:15:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:57,915 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 2654 transitions. [2022-03-15 22:15:57,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 2654 transitions. [2022-03-15 22:15:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:57,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:57,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:57,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:58,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 22:15:58,117 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1521541219, now seen corresponding path program 26 times [2022-03-15 22:15:58,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:58,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273203599] [2022-03-15 22:15:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:58,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:58,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273203599] [2022-03-15 22:15:58,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273203599] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:58,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712698481] [2022-03-15 22:15:58,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:58,164 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:58,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 22:15:58,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:58,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:58,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:58,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:58,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712698481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:58,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:58,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-03-15 22:15:58,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564757850] [2022-03-15 22:15:58,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:58,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:58,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 22:15:58,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:58,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [54572#(or (<= N i) (< k N) (<= (+ 2 i) N)), 54568#(< j M), 54569#(or (< j M) (< k N)), 54567#(< k N), 54570#(or (<= N i) (<= (+ 2 i) N)), 54571#(or (< k N) (< i N)), 54573#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 54574#(or (< k N) (<= (+ 2 i) N))] [2022-03-15 22:15:58,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:15:58,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:15:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:15:58,536 INFO L87 Difference]: Start difference. First operand 629 states and 2654 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:58,984 INFO L93 Difference]: Finished difference Result 892 states and 3352 transitions. [2022-03-15 22:15:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:15:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:15:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:58,986 INFO L225 Difference]: With dead ends: 892 [2022-03-15 22:15:58,986 INFO L226 Difference]: Without dead ends: 892 [2022-03-15 22:15:58,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:15:58,987 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:58,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:15:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-03-15 22:15:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 637. [2022-03-15 22:15:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 4.221698113207547) internal successors, (2685), 636 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 2685 transitions. [2022-03-15 22:15:58,998 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 2685 transitions. Word has length 16 [2022-03-15 22:15:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:58,998 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 2685 transitions. [2022-03-15 22:15:58,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 2685 transitions. [2022-03-15 22:15:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:15:58,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:58,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:59,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:59,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:59,200 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1918119423, now seen corresponding path program 27 times [2022-03-15 22:15:59,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:59,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155836578] [2022-03-15 22:15:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:59,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:59,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155836578] [2022-03-15 22:15:59,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155836578] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:59,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388097823] [2022-03-15 22:15:59,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:59,242 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:59,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 22:15:59,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:15:59,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:59,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:15:59,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:59,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:59,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388097823] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:59,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:59,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-03-15 22:15:59,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1295277940] [2022-03-15 22:15:59,422 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:59,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:59,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2022-03-15 22:15:59,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:59,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [56889#(or (< (+ j 1) M) (< k N) (<= M j)), 56887#(or (< k N) (< i N)), 56891#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i j))), 56890#(or (<= (+ M i) (+ N j)) (< k N)), 56884#(< k N), 56885#(< j M), 56888#(or (< (+ j 1) M) (<= M j)), 56886#(or (< j M) (< k N))] [2022-03-15 22:15:59,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:15:59,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:15:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:15:59,629 INFO L87 Difference]: Start difference. First operand 637 states and 2685 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:00,237 INFO L93 Difference]: Finished difference Result 942 states and 3532 transitions. [2022-03-15 22:16:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:16:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:00,240 INFO L225 Difference]: With dead ends: 942 [2022-03-15 22:16:00,240 INFO L226 Difference]: Without dead ends: 932 [2022-03-15 22:16:00,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=502, Invalid=1850, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:16:00,240 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:00,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-03-15 22:16:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 683. [2022-03-15 22:16:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 4.247800586510264) internal successors, (2897), 682 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2897 transitions. [2022-03-15 22:16:00,253 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 2897 transitions. Word has length 16 [2022-03-15 22:16:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:00,253 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 2897 transitions. [2022-03-15 22:16:00,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 2897 transitions. [2022-03-15 22:16:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:00,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:00,254 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:00,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 22:16:00,467 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1141229380, now seen corresponding path program 28 times [2022-03-15 22:16:00,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:00,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022566467] [2022-03-15 22:16:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:00,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:00,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022566467] [2022-03-15 22:16:00,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022566467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:00,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284911299] [2022-03-15 22:16:00,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:00,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:00,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:00,519 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:00,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 22:16:00,555 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:00,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:00,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:00,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:00,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:00,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284911299] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:00,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:00,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2022-03-15 22:16:00,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188433103] [2022-03-15 22:16:00,699 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:00,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:00,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 78 transitions. [2022-03-15 22:16:00,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:01,073 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [59362#(or (< j M) (< i N)), 59367#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)), 59365#(or (<= N i) (<= (+ 2 k) N) (< j M)), 59368#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 59366#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 59358#(or (<= N i) (<= (+ 2 k) N)), 59359#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 59360#(or (<= N (+ 2 i)) (<= (+ 2 k) N)), 59356#(< i N), 59357#(or (< k N) (< i N)), 59363#(or (<= (+ k 1) N) (< j M)), 59364#(or (< j M) (< k N) (< i N)), 59333#(or (<= (+ 2 k) N) (< j M)), 59361#(< j M)] [2022-03-15 22:16:01,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:16:01,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:16:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:16:01,074 INFO L87 Difference]: Start difference. First operand 683 states and 2897 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:01,993 INFO L93 Difference]: Finished difference Result 1411 states and 4989 transitions. [2022-03-15 22:16:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:16:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:01,997 INFO L225 Difference]: With dead ends: 1411 [2022-03-15 22:16:01,997 INFO L226 Difference]: Without dead ends: 1411 [2022-03-15 22:16:01,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3481, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:16:01,998 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 281 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:01,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 0 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:16:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-03-15 22:16:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2022-03-15 22:16:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 4.2624203821656055) internal successors, (3346), 785 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3346 transitions. [2022-03-15 22:16:02,030 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3346 transitions. Word has length 16 [2022-03-15 22:16:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:02,031 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 3346 transitions. [2022-03-15 22:16:02,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3346 transitions. [2022-03-15 22:16:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:02,033 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:02,033 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:02,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:02,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:02,246 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 80028170, now seen corresponding path program 29 times [2022-03-15 22:16:02,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:02,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899973961] [2022-03-15 22:16:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:02,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:02,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899973961] [2022-03-15 22:16:02,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899973961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:02,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715972638] [2022-03-15 22:16:02,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:16:02,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:02,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:02,292 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:02,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 22:16:02,327 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:16:02,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:02,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:02,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:02,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:02,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715972638] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:02,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:02,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-03-15 22:16:02,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125341026] [2022-03-15 22:16:02,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:02,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:02,449 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 61 transitions. [2022-03-15 22:16:02,449 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:02,660 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [62531#(< k N), 62511#(or (< j M) (<= (+ k 1) i)), 62515#(or (<= k i) (< j M)), 62530#(< j M), 62534#(or (<= N i) (< j M)), 62535#(or (<= N i) (<= k i) (< j M)), 62536#(or (<= N (+ i 1)) (<= k (+ i 1))), 62532#(or (< j M) (< k N)), 62537#(or (<= N (+ i 1)) (< j M) (<= k (+ i 1))), 62538#(or (<= N (+ i 1)) (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 62533#(or (<= N i) (<= k i))] [2022-03-15 22:16:02,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:16:02,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:16:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:16:02,661 INFO L87 Difference]: Start difference. First operand 786 states and 3346 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:03,196 INFO L93 Difference]: Finished difference Result 1190 states and 4587 transitions. [2022-03-15 22:16:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:16:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:03,199 INFO L225 Difference]: With dead ends: 1190 [2022-03-15 22:16:03,199 INFO L226 Difference]: Without dead ends: 1188 [2022-03-15 22:16:03,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=1741, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:16:03,199 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:03,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2022-03-15 22:16:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 845. [2022-03-15 22:16:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 4.280805687203792) internal successors, (3613), 844 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 3613 transitions. [2022-03-15 22:16:03,221 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 3613 transitions. Word has length 16 [2022-03-15 22:16:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:03,221 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 3613 transitions. [2022-03-15 22:16:03,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 3613 transitions. [2022-03-15 22:16:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:03,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:03,223 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:03,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:03,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:03,439 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -718797558, now seen corresponding path program 30 times [2022-03-15 22:16:03,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:03,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806825574] [2022-03-15 22:16:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:03,487 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 22:16:03,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:03,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806825574] [2022-03-15 22:16:03,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806825574] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:03,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141784215] [2022-03-15 22:16:03,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:16:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:03,488 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 22:16:03,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:16:03,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:03,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:03,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:03,590 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 22:16:03,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:03,649 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 22:16:03,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141784215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:03,650 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:03,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 22:16:03,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661581174] [2022-03-15 22:16:03,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:03,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:03,653 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 61 transitions. [2022-03-15 22:16:03,653 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:03,903 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [65570#(< k N), 65575#(or (< j M) (< k N)), 65572#(or (<= N i) (< j M)), 65581#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 65559#(or (< j M) (<= k (+ i 1))), 65573#(or (<= N (+ i 1)) (< j M)), 65574#(or (<= N i) (< k N)), 65579#(or (<= N (+ 2 i)) (< j M)), 65571#(< j M), 65578#(or (<= N (+ i 1)) (< j M) (< k N)), 65577#(or (<= N (+ i 1)) (< k N)), 65580#(or (< j M) (<= k (+ 2 i))), 65576#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:16:03,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:16:03,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:03,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:16:03,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:16:03,904 INFO L87 Difference]: Start difference. First operand 845 states and 3613 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:04,533 INFO L93 Difference]: Finished difference Result 1446 states and 5585 transitions. [2022-03-15 22:16:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:16:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:04,536 INFO L225 Difference]: With dead ends: 1446 [2022-03-15 22:16:04,536 INFO L226 Difference]: Without dead ends: 1442 [2022-03-15 22:16:04,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=723, Invalid=2583, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:16:04,537 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:04,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2022-03-15 22:16:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 946. [2022-03-15 22:16:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.267724867724867) internal successors, (4033), 945 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 4033 transitions. [2022-03-15 22:16:04,556 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 4033 transitions. Word has length 16 [2022-03-15 22:16:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:04,556 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 4033 transitions. [2022-03-15 22:16:04,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 4033 transitions. [2022-03-15 22:16:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:04,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:04,558 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:04,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:04,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 22:16:04,774 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash 646594944, now seen corresponding path program 14 times [2022-03-15 22:16:04,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:04,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177560223] [2022-03-15 22:16:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:04,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:04,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:04,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177560223] [2022-03-15 22:16:04,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177560223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:04,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659805250] [2022-03-15 22:16:04,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:04,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:04,816 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:04,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 22:16:04,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:04,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:04,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:04,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:04,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:04,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659805250] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:04,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:04,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:16:04,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822299041] [2022-03-15 22:16:04,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:04,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:04,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 58 transitions. [2022-03-15 22:16:04,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:05,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [69088#(or (<= (+ 2 k) N) (< j M)), 69090#(or (< k N) (< i N)), 69079#(or (<= k i) (< j M)), 69086#(< j M), 69093#(or (< j M) (<= (+ k 1) i)), 69094#(or (< j M) (<= k (+ i 1))), 69087#(or (<= (+ k 1) N) (< j M)), 69089#(< i N), 69091#(or (< j M) (< i N)), 69092#(or (< j M) (< k N) (< i N))] [2022-03-15 22:16:05,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:16:05,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:16:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:16:05,178 INFO L87 Difference]: Start difference. First operand 946 states and 4033 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:05,535 INFO L93 Difference]: Finished difference Result 1260 states and 4946 transitions. [2022-03-15 22:16:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:16:05,535 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:05,537 INFO L225 Difference]: With dead ends: 1260 [2022-03-15 22:16:05,537 INFO L226 Difference]: Without dead ends: 1260 [2022-03-15 22:16:05,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=1076, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:16:05,538 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:05,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-03-15 22:16:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 974. [2022-03-15 22:16:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 4.277492291880781) internal successors, (4162), 973 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 4162 transitions. [2022-03-15 22:16:05,561 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 4162 transitions. Word has length 16 [2022-03-15 22:16:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:05,561 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 4162 transitions. [2022-03-15 22:16:05,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 4162 transitions. [2022-03-15 22:16:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:05,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:05,563 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:05,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:05,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 22:16:05,764 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash -233856354, now seen corresponding path program 15 times [2022-03-15 22:16:05,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:05,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968524498] [2022-03-15 22:16:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:05,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:05,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968524498] [2022-03-15 22:16:05,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968524498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:05,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243091162] [2022-03-15 22:16:05,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:05,808 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:05,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 22:16:05,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:16:05,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:05,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:05,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:05,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:05,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243091162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:05,913 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:05,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:16:05,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163848736] [2022-03-15 22:16:05,913 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:05,914 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:05,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 56 transitions. [2022-03-15 22:16:05,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:06,086 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [72447#(or (< j M) (<= k (+ i 1))), 72441#(< j M), 72445#(or (<= N i) (< j M) (< k N)), 72440#(< k N), 72433#(or (<= k i) (< j M)), 72444#(or (<= N i) (< k N)), 72442#(or (<= N i) (< j M)), 72446#(or (<= N (+ i 1)) (< j M)), 72443#(or (< j M) (< k N))] [2022-03-15 22:16:06,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:16:06,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:16:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:16:06,087 INFO L87 Difference]: Start difference. First operand 974 states and 4162 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:06,385 INFO L93 Difference]: Finished difference Result 1167 states and 4710 transitions. [2022-03-15 22:16:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 22:16:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:06,388 INFO L225 Difference]: With dead ends: 1167 [2022-03-15 22:16:06,388 INFO L226 Difference]: Without dead ends: 1165 [2022-03-15 22:16:06,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:16:06,389 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:06,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-03-15 22:16:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 973. [2022-03-15 22:16:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 4.279835390946502) internal successors, (4160), 972 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 4160 transitions. [2022-03-15 22:16:06,405 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 4160 transitions. Word has length 16 [2022-03-15 22:16:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:06,405 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 4160 transitions. [2022-03-15 22:16:06,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 4160 transitions. [2022-03-15 22:16:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:06,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:06,407 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:06,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-03-15 22:16:06,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:16:06,608 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1617530752, now seen corresponding path program 16 times [2022-03-15 22:16:06,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:06,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299418519] [2022-03-15 22:16:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:06,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:06,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299418519] [2022-03-15 22:16:06,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299418519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:06,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008724895] [2022-03-15 22:16:06,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:06,652 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:06,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 22:16:06,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:06,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:06,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:16:06,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:06,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:06,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008724895] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:06,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:06,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:16:06,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722903064] [2022-03-15 22:16:06,767 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:06,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:06,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 61 transitions. [2022-03-15 22:16:06,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:07,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [75698#(or (<= N (+ i 1)) (< j M)), 75707#(or (< j M) (<= k (+ i 1))), 75696#(< j M), 75706#(or (< j M) (<= k (+ 2 i))), 75702#(or (<= N i) (< j M) (< k N)), 75700#(or (<= N i) (< k N)), 75689#(or (<= k i) (< j M)), 75699#(< k N), 75705#(or (<= N (+ 2 i)) (< j M)), 75704#(or (<= N (+ i 1)) (< j M) (< k N)), 75701#(or (< j M) (< k N)), 75703#(or (<= N (+ i 1)) (< k N)), 75697#(or (<= N i) (< j M))] [2022-03-15 22:16:07,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:16:07,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:16:07,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:16:07,015 INFO L87 Difference]: Start difference. First operand 973 states and 4160 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:07,391 INFO L93 Difference]: Finished difference Result 1286 states and 5101 transitions. [2022-03-15 22:16:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:16:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:07,393 INFO L225 Difference]: With dead ends: 1286 [2022-03-15 22:16:07,393 INFO L226 Difference]: Without dead ends: 1283 [2022-03-15 22:16:07,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=471, Invalid=1421, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:16:07,395 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:07,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-03-15 22:16:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1006. [2022-03-15 22:16:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 4.276616915422886) internal successors, (4298), 1005 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 4298 transitions. [2022-03-15 22:16:07,411 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 4298 transitions. Word has length 16 [2022-03-15 22:16:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:07,411 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 4298 transitions. [2022-03-15 22:16:07,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 4298 transitions. [2022-03-15 22:16:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:07,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:07,413 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:07,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:07,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:07,629 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1641390741, now seen corresponding path program 31 times [2022-03-15 22:16:07,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:07,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233108542] [2022-03-15 22:16:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:07,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:07,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233108542] [2022-03-15 22:16:07,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233108542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:07,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450925222] [2022-03-15 22:16:07,655 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:16:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:07,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:07,656 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:07,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 22:16:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:07,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:07,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:07,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:07,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450925222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:07,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:07,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:16:07,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074616478] [2022-03-15 22:16:07,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:07,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:07,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2022-03-15 22:16:07,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:07,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [79150#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 79149#(or (<= N i) (<= (+ 2 i) N)), 79151#(< j M)] [2022-03-15 22:16:07,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:16:07,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:16:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:16:07,915 INFO L87 Difference]: Start difference. First operand 1006 states and 4298 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 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 22:16:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:08,011 INFO L93 Difference]: Finished difference Result 1174 states and 4879 transitions. [2022-03-15 22:16:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 22:16:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 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 16 [2022-03-15 22:16:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:08,013 INFO L225 Difference]: With dead ends: 1174 [2022-03-15 22:16:08,013 INFO L226 Difference]: Without dead ends: 1174 [2022-03-15 22:16:08,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:16:08,014 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:08,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-03-15 22:16:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1010. [2022-03-15 22:16:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 4.269573835480674) internal successors, (4308), 1009 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 4308 transitions. [2022-03-15 22:16:08,029 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 4308 transitions. Word has length 16 [2022-03-15 22:16:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:08,029 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 4308 transitions. [2022-03-15 22:16:08,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 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 22:16:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 4308 transitions. [2022-03-15 22:16:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:08,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:08,031 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:08,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 22:16:08,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 22:16:08,231 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash -896688243, now seen corresponding path program 32 times [2022-03-15 22:16:08,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:08,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786612346] [2022-03-15 22:16:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:08,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:08,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786612346] [2022-03-15 22:16:08,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786612346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:08,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002783095] [2022-03-15 22:16:08,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:08,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:08,276 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:08,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 22:16:08,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:08,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:08,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:08,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:16:08,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:08,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002783095] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:08,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:08,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-15 22:16:08,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567073842] [2022-03-15 22:16:08,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:08,416 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:08,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 22:16:08,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:08,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [82456#(or (<= N i) (<= (+ 2 i) N)), 82457#(< j M)] [2022-03-15 22:16:08,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:16:08,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:16:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:16:08,515 INFO L87 Difference]: Start difference. First operand 1010 states and 4308 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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 22:16:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:08,587 INFO L93 Difference]: Finished difference Result 1138 states and 4731 transitions. [2022-03-15 22:16:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:16:08,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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 16 [2022-03-15 22:16:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:08,589 INFO L225 Difference]: With dead ends: 1138 [2022-03-15 22:16:08,589 INFO L226 Difference]: Without dead ends: 1138 [2022-03-15 22:16:08,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:16:08,590 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:08,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:16:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-03-15 22:16:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1053. [2022-03-15 22:16:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1052 states have (on average 4.262357414448669) internal successors, (4484), 1052 states have internal predecessors, (4484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 4484 transitions. [2022-03-15 22:16:08,604 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 4484 transitions. Word has length 16 [2022-03-15 22:16:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:08,604 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 4484 transitions. [2022-03-15 22:16:08,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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 22:16:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 4484 transitions. [2022-03-15 22:16:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:08,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:08,606 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:08,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-03-15 22:16:08,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 22:16:08,807 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -41381589, now seen corresponding path program 33 times [2022-03-15 22:16:08,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:08,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188583805] [2022-03-15 22:16:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:08,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:08,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188583805] [2022-03-15 22:16:08,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188583805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:08,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282818795] [2022-03-15 22:16:08,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:08,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:08,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:08,851 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:08,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 22:16:08,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:16:08,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:08,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:08,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:08,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:09,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282818795] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:09,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:09,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-03-15 22:16:09,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072590755] [2022-03-15 22:16:09,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:09,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:09,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2022-03-15 22:16:09,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:09,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [85812#(< j M), 85813#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:16:09,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:16:09,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:09,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:16:09,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:16:09,135 INFO L87 Difference]: Start difference. First operand 1053 states and 4484 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:09,318 INFO L93 Difference]: Finished difference Result 1453 states and 5823 transitions. [2022-03-15 22:16:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:16:09,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:09,322 INFO L225 Difference]: With dead ends: 1453 [2022-03-15 22:16:09,322 INFO L226 Difference]: Without dead ends: 1431 [2022-03-15 22:16:09,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:16:09,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:09,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2022-03-15 22:16:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1115. [2022-03-15 22:16:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 4.302513464991024) internal successors, (4793), 1114 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 4793 transitions. [2022-03-15 22:16:09,341 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 4793 transitions. Word has length 16 [2022-03-15 22:16:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:09,341 INFO L470 AbstractCegarLoop]: Abstraction has 1115 states and 4793 transitions. [2022-03-15 22:16:09,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 4793 transitions. [2022-03-15 22:16:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:09,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:09,343 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:09,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:09,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:09,557 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1661526319, now seen corresponding path program 34 times [2022-03-15 22:16:09,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:09,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790264945] [2022-03-15 22:16:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:09,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:09,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790264945] [2022-03-15 22:16:09,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790264945] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:09,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637450979] [2022-03-15 22:16:09,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:09,600 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:09,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 22:16:09,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:09,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:09,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:09,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:09,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:09,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637450979] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:09,742 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:09,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:16:09,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699485280] [2022-03-15 22:16:09,742 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:09,743 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:09,745 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 45 transitions. [2022-03-15 22:16:09,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:09,891 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [89623#(or (< j M) (< i N)), 89626#(or (< j M) (<= (+ 2 i) N)), 89622#(or (< j M) (< k N)), 89621#(< j M), 89620#(or (< k N) (< i N)), 89619#(< k N), 89624#(or (< j M) (< k N) (< i N)), 89625#(or (<= N i) (<= (+ 2 i) k))] [2022-03-15 22:16:09,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:16:09,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:16:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:16:09,892 INFO L87 Difference]: Start difference. First operand 1115 states and 4793 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:10,081 INFO L93 Difference]: Finished difference Result 1257 states and 5237 transitions. [2022-03-15 22:16:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:16:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:10,084 INFO L225 Difference]: With dead ends: 1257 [2022-03-15 22:16:10,084 INFO L226 Difference]: Without dead ends: 1257 [2022-03-15 22:16:10,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:16:10,085 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:10,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-03-15 22:16:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1143. [2022-03-15 22:16:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 4.298598949211909) internal successors, (4909), 1142 states have internal predecessors, (4909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 4909 transitions. [2022-03-15 22:16:10,103 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 4909 transitions. Word has length 16 [2022-03-15 22:16:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:10,103 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 4909 transitions. [2022-03-15 22:16:10,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 4909 transitions. [2022-03-15 22:16:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:10,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:10,105 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:10,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 22:16:10,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 22:16:10,306 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1033003123, now seen corresponding path program 35 times [2022-03-15 22:16:10,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:10,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569296224] [2022-03-15 22:16:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:10,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:10,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569296224] [2022-03-15 22:16:10,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569296224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:10,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744030230] [2022-03-15 22:16:10,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:16:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:10,359 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 22:16:10,398 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:16:10,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:10,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:10,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:10,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:10,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744030230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:10,502 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:10,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-03-15 22:16:10,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964319822] [2022-03-15 22:16:10,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:10,503 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:10,505 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2022-03-15 22:16:10,505 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:10,629 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [93294#(or (< k N) (< i N)), 93291#(< j M), 93293#(or (< j M) (< k N)), 93297#(or (< j M) (<= (+ 2 i) N)), 93295#(or (< j M) (< i N)), 93292#(< k N), 93296#(or (< j M) (< k N) (< i N))] [2022-03-15 22:16:10,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:10,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:16:10,630 INFO L87 Difference]: Start difference. First operand 1143 states and 4909 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:10,816 INFO L93 Difference]: Finished difference Result 1287 states and 5344 transitions. [2022-03-15 22:16:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:16:10,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:10,819 INFO L225 Difference]: With dead ends: 1287 [2022-03-15 22:16:10,819 INFO L226 Difference]: Without dead ends: 1287 [2022-03-15 22:16:10,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:16:10,819 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:10,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-03-15 22:16:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1142. [2022-03-15 22:16:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 4.300613496932515) internal successors, (4907), 1141 states have internal predecessors, (4907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 4907 transitions. [2022-03-15 22:16:10,836 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 4907 transitions. Word has length 16 [2022-03-15 22:16:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:10,836 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 4907 transitions. [2022-03-15 22:16:10,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 4907 transitions. [2022-03-15 22:16:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:10,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:10,848 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:10,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 22:16:11,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:11,048 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -68621807, now seen corresponding path program 36 times [2022-03-15 22:16:11,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:11,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192155872] [2022-03-15 22:16:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:11,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:11,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192155872] [2022-03-15 22:16:11,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192155872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:11,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241002809] [2022-03-15 22:16:11,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:16:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:11,094 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:11,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 22:16:11,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:16:11,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:11,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:11,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:11,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:11,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241002809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:11,256 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:11,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-03-15 22:16:11,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740442391] [2022-03-15 22:16:11,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:11,257 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:11,259 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2022-03-15 22:16:11,259 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:11,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [96992#(< j M), 96997#(or (<= N i) (< k N) (<= (+ 2 i) N)), 96996#(or (<= N i) (<= (+ 2 i) N)), 96998#(or (< k N) (<= (+ 2 i) N)), 96995#(or (< k N) (< i N)), 96993#(< k N), 96994#(or (< j M) (< k N))] [2022-03-15 22:16:11,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:11,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:11,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:11,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-03-15 22:16:11,395 INFO L87 Difference]: Start difference. First operand 1142 states and 4907 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:11,607 INFO L93 Difference]: Finished difference Result 1284 states and 5318 transitions. [2022-03-15 22:16:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 22:16:11,608 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:11,610 INFO L225 Difference]: With dead ends: 1284 [2022-03-15 22:16:11,610 INFO L226 Difference]: Without dead ends: 1284 [2022-03-15 22:16:11,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:16:11,611 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:11,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2022-03-15 22:16:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1144. [2022-03-15 22:16:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 4.297462817147856) internal successors, (4912), 1143 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 4912 transitions. [2022-03-15 22:16:11,628 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 4912 transitions. Word has length 16 [2022-03-15 22:16:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:11,628 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 4912 transitions. [2022-03-15 22:16:11,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 4912 transitions. [2022-03-15 22:16:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:11,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:11,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:11,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 22:16:11,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 22:16:11,832 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 786684847, now seen corresponding path program 37 times [2022-03-15 22:16:11,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:11,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338191280] [2022-03-15 22:16:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:11,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:11,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338191280] [2022-03-15 22:16:11,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338191280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:11,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027067545] [2022-03-15 22:16:11,889 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:16:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:11,890 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:11,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 22:16:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:11,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:12,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:16:12,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027067545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:12,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:12,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-03-15 22:16:12,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306141533] [2022-03-15 22:16:12,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:12,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:12,079 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 48 transitions. [2022-03-15 22:16:12,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:12,245 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [100704#(or (<= (+ M i) (+ N j)) (< k N)), 100698#(< k N), 100703#(or (< (+ j 1) M) (< k N) (<= M j)), 100700#(or (< j M) (< k N)), 100699#(< j M), 100702#(or (< (+ j 1) M) (<= M j)), 100701#(or (< k N) (< i N))] [2022-03-15 22:16:12,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:12,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:16:12,246 INFO L87 Difference]: Start difference. First operand 1144 states and 4912 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:12,666 INFO L93 Difference]: Finished difference Result 1385 states and 5587 transitions. [2022-03-15 22:16:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:16:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:12,669 INFO L225 Difference]: With dead ends: 1385 [2022-03-15 22:16:12,669 INFO L226 Difference]: Without dead ends: 1373 [2022-03-15 22:16:12,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=453, Invalid=1617, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:16:12,670 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:12,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-03-15 22:16:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1157. [2022-03-15 22:16:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 4.301038062283737) internal successors, (4972), 1156 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 4972 transitions. [2022-03-15 22:16:12,689 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 4972 transitions. Word has length 16 [2022-03-15 22:16:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:12,689 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 4972 transitions. [2022-03-15 22:16:12,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 4972 transitions. [2022-03-15 22:16:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:12,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:12,691 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:12,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:12,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 22:16:12,892 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 745101133, now seen corresponding path program 38 times [2022-03-15 22:16:12,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:12,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112404443] [2022-03-15 22:16:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:12,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:12,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112404443] [2022-03-15 22:16:12,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112404443] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:12,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532374604] [2022-03-15 22:16:12,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:12,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:12,938 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:12,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 22:16:12,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:12,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:12,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:12,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:13,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:13,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532374604] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:13,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:13,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:16:13,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634365835] [2022-03-15 22:16:13,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:13,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:13,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2022-03-15 22:16:13,095 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:13,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [104556#(or (<= N i) (<= (+ 2 i) N)), 104559#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 104557#(or (<= N i) (< k N) (<= (+ 2 i) N)), 104558#(or (< k N) (<= (+ 2 i) N)), 104553#(or (< k N) (< i N)), 104554#(< j M), 104561#(or (<= (+ 3 i) N) (< k N)), 104552#(< k N), 104555#(or (< j M) (< k N)), 104560#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< k N))] [2022-03-15 22:16:13,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:16:13,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:13,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:16:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:16:13,304 INFO L87 Difference]: Start difference. First operand 1157 states and 4972 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:13,497 INFO L93 Difference]: Finished difference Result 1267 states and 5319 transitions. [2022-03-15 22:16:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 22:16:13,498 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:13,500 INFO L225 Difference]: With dead ends: 1267 [2022-03-15 22:16:13,500 INFO L226 Difference]: Without dead ends: 1267 [2022-03-15 22:16:13,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:16:13,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:13,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-03-15 22:16:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1157. [2022-03-15 22:16:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 4.301038062283737) internal successors, (4972), 1156 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 4972 transitions. [2022-03-15 22:16:13,518 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 4972 transitions. Word has length 16 [2022-03-15 22:16:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:13,518 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 4972 transitions. [2022-03-15 22:16:13,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 4972 transitions. [2022-03-15 22:16:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:13,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:13,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:13,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 22:16:13,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:13,721 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1489803631, now seen corresponding path program 39 times [2022-03-15 22:16:13,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:13,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130778499] [2022-03-15 22:16:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:13,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:13,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130778499] [2022-03-15 22:16:13,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130778499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:13,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079488639] [2022-03-15 22:16:13,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:13,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:13,773 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:13,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 22:16:13,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:16:13,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:13,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:13,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:13,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:13,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079488639] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:13,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:13,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:16:13,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856752616] [2022-03-15 22:16:13,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:13,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:13,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 45 transitions. [2022-03-15 22:16:13,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:14,113 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [108269#(or (< k N) (<= (+ 2 i) N)), 108270#(or (< k N) (<= (+ M i 1) (+ N j))), 108264#(< j M), 108267#(or (<= N i) (<= (+ 2 i) N)), 108266#(or (< k N) (< i N)), 108263#(< k N), 108268#(or (<= N i) (< k N) (<= (+ 2 i) N)), 108265#(or (< j M) (< k N))] [2022-03-15 22:16:14,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:16:14,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:16:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:16:14,114 INFO L87 Difference]: Start difference. First operand 1157 states and 4972 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:14,330 INFO L93 Difference]: Finished difference Result 1293 states and 5384 transitions. [2022-03-15 22:16:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:16:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:14,333 INFO L225 Difference]: With dead ends: 1293 [2022-03-15 22:16:14,333 INFO L226 Difference]: Without dead ends: 1293 [2022-03-15 22:16:14,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:16:14,333 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:14,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-03-15 22:16:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1158. [2022-03-15 22:16:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 4.298184961106309) internal successors, (4973), 1157 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 4973 transitions. [2022-03-15 22:16:14,351 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 4973 transitions. Word has length 16 [2022-03-15 22:16:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:14,351 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 4973 transitions. [2022-03-15 22:16:14,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 4973 transitions. [2022-03-15 22:16:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:16:14,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:14,353 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:14,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:14,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:14,568 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1949857011, now seen corresponding path program 40 times [2022-03-15 22:16:14,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:14,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401638997] [2022-03-15 22:16:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:14,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:14,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401638997] [2022-03-15 22:16:14,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401638997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:14,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561145926] [2022-03-15 22:16:14,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:14,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:14,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:14,609 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:14,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 22:16:14,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:14,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:14,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:16:14,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:14,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:14,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561145926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:14,798 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:14,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:16:14,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070594982] [2022-03-15 22:16:14,798 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:14,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:14,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2022-03-15 22:16:14,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:14,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [112006#(< k N), 112010#(or (< (+ j 1) M) (< k N) (<= M j)), 112012#(or (<= (+ M i) (+ N j)) (< k N)), 112013#(or (< k N) (<= (+ M i 1) (+ N j))), 112009#(or (< j M) (< k N)), 112011#(or (< k N) (< i N)), 112007#(< j M), 112008#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:16:14,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:16:14,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:16:14,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:16:14,985 INFO L87 Difference]: Start difference. First operand 1158 states and 4973 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:15,334 INFO L93 Difference]: Finished difference Result 1360 states and 5571 transitions. [2022-03-15 22:16:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:16:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:16:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:15,337 INFO L225 Difference]: With dead ends: 1360 [2022-03-15 22:16:15,337 INFO L226 Difference]: Without dead ends: 1350 [2022-03-15 22:16:15,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:16:15,337 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:15,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-03-15 22:16:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1159. [2022-03-15 22:16:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 4.304835924006908) internal successors, (4985), 1158 states have internal predecessors, (4985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 4985 transitions. [2022-03-15 22:16:15,354 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 4985 transitions. Word has length 16 [2022-03-15 22:16:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:15,354 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 4985 transitions. [2022-03-15 22:16:15,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 4985 transitions. [2022-03-15 22:16:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:15,356 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:15,356 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:15,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:15,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:15,563 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1041770673, now seen corresponding path program 41 times [2022-03-15 22:16:15,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:15,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208469121] [2022-03-15 22:16:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:15,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:15,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208469121] [2022-03-15 22:16:15,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208469121] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:15,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888939434] [2022-03-15 22:16:15,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:16:15,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:15,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:15,906 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:15,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 22:16:15,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:16:15,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:15,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:16:15,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:16,057 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 22:16:16,087 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 16 treesize of output 18 [2022-03-15 22:16:16,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:16,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:16,229 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 23 treesize of output 28 [2022-03-15 22:16:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:16,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:16,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:16,395 INFO L353 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2022-03-15 22:16:16,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 22 [2022-03-15 22:16:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:16,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888939434] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:16,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:16,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:16:16,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701178585] [2022-03-15 22:16:16,546 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:16,547 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:16,551 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 88 transitions. [2022-03-15 22:16:16,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:18,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [115856#(and (or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ i 1) N) (not (< i N)) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (= l j)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (not (< i N)) (not (= l 0)) (< (+ 2 j) M) (= l i) (= l j))), 115849#(or (= (select A l) (select B l)) (= l k) (< j M)), 115852#(or (= (select A l) (select B l)) (< j M) (< i N)), 115853#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= l 0))) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ i 1) N))), 115855#(and (or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (< i N) (= l j)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (not (= l 0)) (< (+ 2 j) M) (= l j))), 115859#(and (or (<= N (+ i 1)) (<= l M) (<= (+ l i) N)) (or (<= N (+ i 1)) (= M l) (not (= l 0)) (not (= k j))) (or (<= N (+ i 1)) (= l 0) (not (= k 1)) (<= (+ 2 M i) (+ N l))) (or (<= N (+ i 1)) (= M l) (= j 0)) (or (<= N (+ i 1)) (= l k) (not (= M l))) (or (<= N (+ i 1)) (= l 1) (= l 0) (<= (+ 2 M i) (+ N l)))), 115854#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (not (= l 0)) (= l j)) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (<= (+ i 1) N) (= l j))), 115858#(and (or (= M l) (<= N i) (not (= l 0)) (not (= k j))) (or (= l k) (<= N i) (not (= M l))) (or (<= N i) (= l 0) (not (= k 1)) (<= (+ M i 1) (+ N l))) (or (<= (+ l i) (+ N 1)) (<= N i) (<= l M)) (or (= M l) (<= N i) (= j 0)) (or (= l 1) (<= N i) (= l 0) (<= (+ M i 1) (+ N l)))), 115857#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (not (< (+ i 1) N)) (= (+ j 1) l) (not (= l 0)) (< (+ 2 j) M) (= l i) (= l j) (= (+ i 1) l)) (or (= (select A l) (select B l)) (= l k) (not (< (+ i 1) N)) (= (+ j 1) l) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (= l j) (= (+ i 1) l))), 115851#(or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l j)), 115848#(or (= (select A l) (select B l)) (< i N)), 115860#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (not (< (+ 2 i) N)) (not (= l 0)) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l))), 115850#(or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (= l j)), 115847#(or (= (select A l) (select B l)) (< j M)), 115861#(and (or (<= N (+ 2 i)) (= l k) (not (= M l))) (or (<= N (+ 2 i)) (= M l) (= j 0)) (or (<= N (+ 2 i)) (= l 0) (not (= k 1)) (<= (+ 3 M i) (+ N l))) (or (= l 1) (<= N (+ 2 i)) (= l 0) (<= (+ 3 M i) (+ N l))) (or (<= N (+ 2 i)) (= M l) (not (= l 0)) (not (= k j))) (or (<= N (+ 2 i)) (<= (+ l i 1) N) (<= l M)))] [2022-03-15 22:16:18,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:16:18,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:16:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:16:18,145 INFO L87 Difference]: Start difference. First operand 1159 states and 4985 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 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 22:16:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:26,398 INFO L93 Difference]: Finished difference Result 2299 states and 9266 transitions. [2022-03-15 22:16:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:16:26,398 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 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 22:16:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:26,404 INFO L225 Difference]: With dead ends: 2299 [2022-03-15 22:16:26,404 INFO L226 Difference]: Without dead ends: 2255 [2022-03-15 22:16:26,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3765 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2032, Invalid=10624, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 22:16:26,405 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 491 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:26,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 0 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:16:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2022-03-15 22:16:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1388. [2022-03-15 22:16:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1387 states have (on average 4.426820475847152) internal successors, (6140), 1387 states have internal predecessors, (6140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 6140 transitions. [2022-03-15 22:16:26,434 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 6140 transitions. Word has length 17 [2022-03-15 22:16:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:26,434 INFO L470 AbstractCegarLoop]: Abstraction has 1388 states and 6140 transitions. [2022-03-15 22:16:26,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 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 22:16:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 6140 transitions. [2022-03-15 22:16:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:26,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:26,437 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:26,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-15 22:16:26,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 22:16:26,637 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:26,637 INFO L85 PathProgramCache]: Analyzing trace with hash 133470971, now seen corresponding path program 42 times [2022-03-15 22:16:26,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:26,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992169248] [2022-03-15 22:16:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:26,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:26,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992169248] [2022-03-15 22:16:26,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992169248] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:26,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762100668] [2022-03-15 22:16:26,952 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:16:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:26,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:26,953 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 22:16:26,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:16:26,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:26,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:16:26,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:27,121 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 8 treesize of output 7 [2022-03-15 22:16:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:27,231 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 20 treesize of output 22 [2022-03-15 22:16:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:27,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:27,259 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 27 treesize of output 32 [2022-03-15 22:16:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:27,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:27,427 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:16:27,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:16:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:27,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762100668] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:27,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:27,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:16:27,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404937343] [2022-03-15 22:16:27,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:27,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:27,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 93 transitions. [2022-03-15 22:16:27,585 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:29,532 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [121213#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M) (< i N)), 121212#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< i N)), 121204#(or (= (select A l) (select B l)) (< j M) (< k N)), 121207#(and (or (< (+ j 1) M) (= l k) (= l 0) (< (+ 2 k) N) (not (< j M)) (= (+ l 1) N)) (or (= (select A l) (select B l)) (<= (+ 3 k) N) (< (+ j 1) M) (= l k) (not (< j M)) (= l (+ k 1)) (= l j)) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 121209#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 121216#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 2 l) N) (<= l M) (= (+ (- 1) N) l) (< 3 N)) (or (<= N i) (= j 0)) (or (<= N i) (= l 0) (< 0 l) (< 3 N) (< M (+ l 1))) (or (<= 3 N) (<= N i))), 121218#(and (or (<= N (+ 2 i)) (< (+ j 1) M) (= l k) (= l 0) (< (+ 2 k) N) (not (< j M)) (= (+ l 1) N)) (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (= (select A l) (select B l)) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (= l k) (not (< j M)) (= l (+ k 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l))), 121205#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M)), 121203#(or (= (select A l) (select B l)) (< j M)), 121217#(and (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 3 N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= (+ 2 l) N) (<= l M) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ i 1)) (= l 0) (< 0 l) (< 3 N) (< M (+ l 1)))), 121206#(and (or (= l k) (< j M) (= l 0) (< (+ 2 k) N) (= (+ l 1) N)) (or (<= (+ 2 k) N) (< j M)) (or (= (select A l) (select B l)) (<= (+ 3 k) N) (= l k) (< j M) (= l (+ k 1)))), 121215#(and (or (<= N (+ i 1)) (= (select A l) (select B l)) (<= (+ 3 k) N) (< (+ j 1) M) (= l k) (not (< j M)) (= l (+ k 1)) (= l i) (= l j) (= (+ i 1) l)) (or (<= N (+ i 1)) (< (+ j 1) M) (= l k) (= l 0) (< (+ 2 k) N) (not (< j M)) (= (+ l 1) N)) (or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 121208#(or (= (select A l) (select B l)) (< i N)), 121210#(or (= (select A l) (select B l)) (< j M) (< i N)), 121211#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 121219#(and (or (<= N (+ 2 i)) (= l 0) (< 0 l) (< 3 N) (< M (+ l 1))) (or (<= N (+ 2 i)) (<= (+ 2 l) N) (<= l M) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 3 N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 121214#(and (or (= (select A l) (select B l)) (<= (+ 3 k) N) (< (+ j 1) M) (= l k) (<= N i) (not (< j M)) (= l (+ k 1)) (= l i) (= l j)) (or (< (+ j 1) M) (<= N i) (<= (+ 2 k) N) (not (< j M))) (or (< (+ j 1) M) (= l k) (<= N i) (= l 0) (< (+ 2 k) N) (not (< j M)) (= (+ l 1) N)))] [2022-03-15 22:16:29,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:16:29,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:16:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:16:29,533 INFO L87 Difference]: Start difference. First operand 1388 states and 6140 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:37,691 INFO L93 Difference]: Finished difference Result 2367 states and 9275 transitions. [2022-03-15 22:16:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-03-15 22:16:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:16:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:37,696 INFO L225 Difference]: With dead ends: 2367 [2022-03-15 22:16:37,696 INFO L226 Difference]: Without dead ends: 2345 [2022-03-15 22:16:37,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6090 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3289, Invalid=16451, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 22:16:37,701 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:37,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:16:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-03-15 22:16:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1502. [2022-03-15 22:16:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 4.441039307128581) internal successors, (6666), 1501 states have internal predecessors, (6666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 6666 transitions. [2022-03-15 22:16:37,727 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 6666 transitions. Word has length 17 [2022-03-15 22:16:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:37,727 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 6666 transitions. [2022-03-15 22:16:37,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 6666 transitions. [2022-03-15 22:16:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:37,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:37,730 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:37,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:37,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 22:16:37,943 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1514934027, now seen corresponding path program 43 times [2022-03-15 22:16:37,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:37,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78961914] [2022-03-15 22:16:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:38,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:38,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78961914] [2022-03-15 22:16:38,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78961914] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:38,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843562719] [2022-03-15 22:16:38,359 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:16:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:38,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:38,360 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:38,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 22:16:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:38,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:16:38,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:38,510 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 8 treesize of output 7 [2022-03-15 22:16:38,592 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:16:38,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:16:38,671 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-03-15 22:16:38,671 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:16:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:38,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:38,855 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:16:38,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:16:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:39,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843562719] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:39,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:39,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:16:39,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712537864] [2022-03-15 22:16:39,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:39,007 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:39,010 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 76 transitions. [2022-03-15 22:16:39,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:41,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [126919#(and (or (<= N (+ 2 i)) (= (+ j 1) l) (<= (+ j 4) N) (= l 0) (<= M j) (<= (+ 2 j) l)) (or (<= N (+ 2 i)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (= l 0) (not (< j M)) (< 0 l)) (or (<= N (+ 2 i)) (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (<= N (+ 2 i)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (not (< j M)) (not (= l 0)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ l 1) N) (<= N (+ 2 i)) (<= (+ j 4) N) (<= l M) (<= M j))), 126914#(or (= (select A l) (select B l)) (< k N) (< i N)), 126913#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (= l (+ (- 2) N)) (= M l) (<= N i) (not (<= l M)) (= l 0) (<= 2 l) (< 3 N)) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (<= N i) (<= l M) (< 3 N)) (or (<= 3 N) (<= N i))), 126912#(or (= (select A l) (select B l)) (< j M) (< k N)), 126917#(and (or (<= (+ 2 k j) (+ N M)) (<= l M) (< i N) (= l j) (<= (+ l k) (+ N M))) (or (= (select A l) (select B l)) (not (<= l M)) (<= (+ 2 k j) (+ N M)) (not (= l 0)) (< i N) (= l j)) (or (= (select A l) (select B l)) (not (= M l)) (<= (+ 2 k j) (+ N M)) (< i N) (= l j)) (or (= M l) (not (<= l M)) (<= (+ 2 k j) (+ N M)) (= l 0) (<= (+ j 1) l) (< i N) (= l j)) (or (= M l) (not (<= l M)) (<= (+ 2 k j) (+ N M)) (= l 0) (< 0 l) (< i N) (= l j))), 126915#(or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M) (< i N)), 126910#(and (or (= (+ j 1) l) (<= N i) (<= (+ j 4) N) (= l 0) (<= M j) (<= (+ 2 j) l)) (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (<= N i) (not (<= l M)) (<= (+ j 4) N) (not (< j M)) (not (= l 0)) (= l i) (= l j)) (or (<= (+ l 1) N) (<= N i) (<= (+ j 4) N) (<= l M) (<= M j)) (or (= M l) (= (+ j 1) l) (<= N i) (not (<= l M)) (<= (+ j 4) N) (= l 0) (not (< j M)) (< 0 l)) (or (<= N i) (not (< j M)) (= M k))), 126918#(and (or (<= N (+ i 1)) (not (< j M)) (= M k)) (or (<= N (+ i 1)) (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (<= N (+ i 1)) (= (+ j 1) l) (<= (+ j 4) N) (= l 0) (<= M j) (<= (+ 2 j) l)) (or (<= N (+ i 1)) (<= (+ l 1) N) (<= (+ j 4) N) (<= l M) (<= M j)) (or (<= N (+ i 1)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (= l 0) (not (< j M)) (< 0 l))), 126916#(and (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< i N) (= l j)) (or (<= (+ 2 j) M) (<= l M) (< i N) (= l j)) (or (<= (+ 2 j) M) (= M l) (= l 0) (< i N) (= l j))), 126908#(or (= (select A l) (select B l)) (<= (+ j 1) M) (< i N)), 126911#(or (= (select A l) (select B l)) (< k N)), 126920#(and (or (= l (+ (- 2) N)) (<= N (+ i 1)) (= M l) (not (<= l M)) (= l 0) (<= 2 l) (< 3 N)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 3 N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= (+ l 1) N) (<= l M) (< 3 N))), 126909#(and (or (not (< j M)) (= M k)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (= l 0) (not (< j M)) (< 0 l)) (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ j 4) N) (not (< j M)) (not (= l 0)) (= l j)) (or (= (+ j 1) l) (<= (+ j 4) N) (= l 0) (<= M j) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ j 4) N) (<= l M) (<= M j))), 126921#(and (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 3 N)) (or (= l (+ (- 2) N)) (<= N (+ 2 i)) (= M l) (not (<= l M)) (= l 0) (<= 2 l) (< 3 N)) (or (<= (+ l 1) N) (<= N (+ 2 i)) (<= l M) (< 3 N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 126907#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:16:41,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:16:41,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:16:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:16:41,515 INFO L87 Difference]: Start difference. First operand 1502 states and 6666 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:47,232 INFO L93 Difference]: Finished difference Result 2217 states and 8891 transitions. [2022-03-15 22:16:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:16:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:16:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:47,237 INFO L225 Difference]: With dead ends: 2217 [2022-03-15 22:16:47,237 INFO L226 Difference]: Without dead ends: 2186 [2022-03-15 22:16:47,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1742 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1073, Invalid=6583, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:16:47,237 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:47,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:16:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2022-03-15 22:16:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1548. [2022-03-15 22:16:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1547 states have (on average 4.43956043956044) internal successors, (6868), 1547 states have internal predecessors, (6868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 6868 transitions. [2022-03-15 22:16:47,263 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 6868 transitions. Word has length 17 [2022-03-15 22:16:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:47,263 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 6868 transitions. [2022-03-15 22:16:47,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 6868 transitions. [2022-03-15 22:16:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:47,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:47,266 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:47,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:47,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:47,484 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2040951281, now seen corresponding path program 17 times [2022-03-15 22:16:47,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:47,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782553555] [2022-03-15 22:16:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:47,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:47,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782553555] [2022-03-15 22:16:47,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782553555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:47,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528641289] [2022-03-15 22:16:47,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:16:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:47,814 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:47,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 22:16:47,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:16:47,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:47,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:16:47,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:48,048 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 22:16:48,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:48,080 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 22:16:48,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:48,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:48,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:48,111 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 31 treesize of output 36 [2022-03-15 22:16:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:48,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:48,215 INFO L353 Elim1Store]: treesize reduction 47, result has 23.0 percent of original size [2022-03-15 22:16:48,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 22:16:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:48,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528641289] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:48,429 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:48,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:16:48,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013392942] [2022-03-15 22:16:48,429 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:48,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:48,434 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 113 transitions. [2022-03-15 22:16:48,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:50,845 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [132472#(and (or (<= N (+ 2 i)) (= k 0) (not (= M 0))) (or (<= N (+ 2 i)) (= M 0) (= j 0)) (or (= l (+ (- 2) N)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l 0) (= (+ (- 1) N) l) (not (= M 0)) (< 3 N)) (or (<= N (+ 2 i)) (= l 0) (not (= M 0)) (< 0 l) (< 3 N)) (or (<= N (+ 2 i)) (<= 3 N) (not (= M 0))) (or (<= N (+ 2 i)) (= M 0) (< 0 M))), 132453#(and (or (= l k) (< j M) (= l 0) (< (+ 2 k) N) (= (+ l 1) N)) (or (<= (+ 2 k) N) (< j M)) (or (= (select A l) (select B l)) (= l k) (< j M) (< (+ 2 k) N) (= (+ l 1) N))), 132459#(or (= (select A l) (select B l)) (< j M) (< i N)), 132463#(and (or (<= (+ 2 k) N) (< i N)) (or (= (select A l) (select B l)) (<= (+ 3 k) N) (= l k) (= l (+ k 1)) (< i N)) (or (= l k) (= l 0) (< (+ 2 k) N) (= (+ l 1) N) (< i N))), 132470#(and (or (= l (+ (- 2) N)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l 0) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ 2 i)) (<= 3 N)) (or (<= N (+ 2 i)) (= l 0) (< 0 l) (< 3 N)) (or (<= N (+ 2 i)) (= k 0))), 132468#(and (or (= l (+ (- 2) N)) (<= N i) (= l 0) (= (+ (- 1) N) l) (not (= M 0)) (<= (+ 2 i) N) (< 3 N)) (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (= l 0) (not (= M 0)) (< 0 l) (< 3 N)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (<= 3 N) (<= N i) (not (= M 0)))), 132464#(and (or (= l k) (< j M) (= l 0) (< (+ 2 k) N) (= (+ l 1) N) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (= (select A l) (select B l)) (<= (+ 3 k) N) (= l k) (< j M) (= l (+ k 1)) (< i N))), 132457#(or (= (select A l) (select B l)) (< i N)), 132452#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M)), 132462#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M) (< i N)), 132471#(and (or (<= N (+ 2 i)) (< j M) (= k 0)) (or (<= N (+ 2 i)) (< j M) (= l 0) (< 0 l) (< 3 N)) (or (= l (+ (- 2) N)) (<= N (+ 2 i)) (<= (+ i 4) N) (< j M) (= l 0) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ 2 i)) (<= 3 N) (< j M))), 132450#(or (= (select A l) (select B l)) (< j M)), 132461#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< i N)), 132469#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (= l 0) (not (= M 0)) (< 0 l) (< 3 N)) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (= l (+ (- 2) N)) (<= N (+ i 1)) (<= (+ 3 i) N) (= l 0) (= (+ (- 1) N) l) (not (= M 0)) (< 3 N)) (or (<= N (+ i 1)) (= M 0) (= j 0)) (or (<= N (+ i 1)) (<= 3 N) (not (= M 0)))), 132456#(and (or (<= 3 N) (< j M)) (or (< j M) (= k 0)) (or (= l (+ (- 2) N)) (< j M) (= l 0) (= (+ (- 1) N) l) (< 3 N))), 132458#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 132460#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 132467#(and (or (<= N (+ i 1)) (< j M) (= l 0) (< 0 l) (< 3 N)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (= l (+ (- 2) N)) (<= N (+ i 1)) (<= (+ 3 i) N) (< j M) (= l 0) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ i 1)) (<= 3 N) (< j M))), 132454#(and (or (= l (+ (- 2) N)) (<= N i) (= l 0) (= (+ (- 1) N) l) (<= (+ 2 i) N) (< 3 N)) (or (<= N i) (= l 0) (< 0 l) (< 3 N)) (or (<= 3 N) (<= N i)) (or (<= N i) (= k 0))), 132465#(and (or (< j M) (= l 0) (< 0 l) (< 3 N)) (or (<= 3 N) (< j M)) (or (= l (+ (- 2) N)) (< j M) (= l 0) (= (+ (- 1) N) l) (<= (+ i 1) N) (< 3 N)) (or (< j M) (= k 0))), 132455#(and (or (<= N (+ i 1)) (<= 3 N)) (or (= l (+ (- 2) N)) (<= N (+ i 1)) (<= (+ 3 i) N) (= l 0) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ i 1)) (= k 0)) (or (<= N (+ i 1)) (= l 0) (< 0 l) (< 3 N))), 132451#(or (= (select A l) (select B l)) (< j M) (< k N)), 132466#(and (or (<= 3 N) (<= N i) (< j M)) (or (= l (+ (- 2) N)) (<= N i) (< j M) (= l 0) (= (+ (- 1) N) l) (<= (+ 2 i) N) (< 3 N)) (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (= l 0) (< 0 l) (< 3 N)))] [2022-03-15 22:16:50,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:16:50,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:16:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2318, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:16:50,846 INFO L87 Difference]: Start difference. First operand 1548 states and 6868 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:56,428 INFO L93 Difference]: Finished difference Result 2049 states and 8269 transitions. [2022-03-15 22:16:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:16:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:16:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:56,434 INFO L225 Difference]: With dead ends: 2049 [2022-03-15 22:16:56,434 INFO L226 Difference]: Without dead ends: 2039 [2022-03-15 22:16:56,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1623, Invalid=8883, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 22:16:56,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 358 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:56,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 0 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:16:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-03-15 22:16:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1561. [2022-03-15 22:16:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1560 states have (on average 4.424358974358975) internal successors, (6902), 1560 states have internal predecessors, (6902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 6902 transitions. [2022-03-15 22:16:56,460 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 6902 transitions. Word has length 17 [2022-03-15 22:16:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:56,461 INFO L470 AbstractCegarLoop]: Abstraction has 1561 states and 6902 transitions. [2022-03-15 22:16:56,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 6902 transitions. [2022-03-15 22:16:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:16:56,464 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:56,464 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:56,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-15 22:16:56,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:56,664 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1915137741, now seen corresponding path program 44 times [2022-03-15 22:16:56,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:56,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462416218] [2022-03-15 22:16:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:57,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:57,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462416218] [2022-03-15 22:16:57,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462416218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:57,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999156691] [2022-03-15 22:16:57,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:57,048 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:16:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 22:16:57,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:57,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:57,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:16:57,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:57,271 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 8 treesize of output 7 [2022-03-15 22:16:57,342 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:16:57,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:16:57,380 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-03-15 22:16:57,380 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:16:57,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 22:16:57,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:57,529 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:16:57,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:16:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:57,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999156691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:57,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:57,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:16:57,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1625043250] [2022-03-15 22:16:57,719 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:57,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:57,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 79 transitions. [2022-03-15 22:16:57,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:59,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [137872#(or (= (select A l) (select B l)) (< j M) (< k N)), 137877#(or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M) (< i N)), 137880#(and (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< i N) (= l j)) (or (<= (+ 2 j) M) (= l 0) (< i N) (= l j) (< M (+ l 1))) (or (<= (+ 2 j) M) (= l 0) (<= l M) (< i N) (= l j))), 137871#(or (= (select A l) (select B l)) (< k N)), 137873#(or (= (select A l) (select B l)) (< i N)), 137878#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (= l (+ (- 2) N)) (<= N i) (< 3 N) (= l j) (<= (+ M i 1) (+ N l))) (or (<= (+ l 1) N) (<= N i) (<= l M) (< 3 N)) (or (<= 3 N) (<= N i))), 137876#(or (= (select A l) (select B l)) (< k N) (< i N)), 137874#(or (= (select A l) (select B l)) (<= (+ j 1) M) (< i N)), 137882#(and (or (<= l M) (< 2 M) (< i N)) (or (= (select A l) (select B l)) (not (= M l)) (< 2 M) (< i N)) (or (<= 2 M) (< i N)) (or (= j 0) (< i N)) (or (= (+ (- 1) M) l) (< 2 M) (< i N) (= l j) (< M (+ l 1)))), 137884#(and (or (= (+ l k 1) (+ N M)) (< (+ 2 k) (+ N M)) (< i N) (= l j) (< M (+ l 1))) (or (= j 0) (< i N)) (or (<= (+ 2 k) (+ N M)) (< i N)) (or (= M l) (< (+ 2 k) (+ N M)) (< i N) (<= (+ l k) (+ N M))) (or (= (select A l) (select B l)) (<= (+ k 1) N) (not (= M l)) (< (+ 2 k) (+ N M)) (< i N))), 137883#(and (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (< i N) (= l j)) (or (<= (+ 2 j) M) (= l 0) (< k N) (< i N) (= l j) (< M (+ l 1))) (or (<= (+ 2 j) M) (= l 0) (<= l M) (< k N) (< i N) (= l j))), 137875#(and (or (<= (+ 2 j) M) (= l 0) (< k N) (= l j) (< M (+ l 1))) (or (<= (+ 2 j) M) (= l 0) (<= l M) (< k N) (= l j)) (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j))), 137881#(and (or (= l (+ (- 2) N)) (<= N (+ 2 i)) (<= (+ 3 M i) (+ N l)) (< 3 N) (= l j)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 3 N)) (or (<= (+ l 1) N) (<= N (+ 2 i)) (<= l M) (< 3 N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 137879#(and (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 3 N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (= l (+ (- 2) N)) (<= N (+ i 1)) (<= (+ 2 M i) (+ N l)) (< 3 N) (= l j)) (or (<= N (+ i 1)) (<= (+ l 1) N) (<= l M) (< 3 N)))] [2022-03-15 22:16:59,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:16:59,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:16:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:16:59,361 INFO L87 Difference]: Start difference. First operand 1561 states and 6902 transitions. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:02,408 INFO L93 Difference]: Finished difference Result 1983 states and 8160 transitions. [2022-03-15 22:17:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:17:02,408 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:02,412 INFO L225 Difference]: With dead ends: 1983 [2022-03-15 22:17:02,412 INFO L226 Difference]: Without dead ends: 1968 [2022-03-15 22:17:02,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=722, Invalid=4390, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:17:02,412 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:02,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:17:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-03-15 22:17:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1569. [2022-03-15 22:17:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 4.432397959183674) internal successors, (6950), 1568 states have internal predecessors, (6950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 6950 transitions. [2022-03-15 22:17:02,436 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 6950 transitions. Word has length 17 [2022-03-15 22:17:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:02,436 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 6950 transitions. [2022-03-15 22:17:02,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 6950 transitions. [2022-03-15 22:17:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:02,439 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:02,439 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:02,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-03-15 22:17:02,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:02,643 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 331455121, now seen corresponding path program 45 times [2022-03-15 22:17:02,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:02,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144135634] [2022-03-15 22:17:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:03,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:03,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144135634] [2022-03-15 22:17:03,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144135634] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:03,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986019544] [2022-03-15 22:17:03,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:03,002 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:03,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 22:17:03,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:17:03,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:03,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:17:03,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:03,179 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 22:17:03,207 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:17:03,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:17:03,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:03,263 INFO L353 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-03-15 22:17:03,263 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:17:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:03,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:03,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:03,452 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:17:03,453 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 26 treesize of output 46 [2022-03-15 22:17:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:03,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986019544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:03,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:03,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 22:17:03,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866927888] [2022-03-15 22:17:03,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:03,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:03,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 73 transitions. [2022-03-15 22:17:03,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:05,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [143198#(and (or (<= N (+ i 1)) (<= (+ 3 i) N) (<= l (+ j 1)) (<= l M) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 3 N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= (+ 3 i) N) (= l 0) (< 0 l) (< 3 N) (< M (+ l 1)))), 143191#(or (= (select A l) (select B l)) (< j M)), 143199#(and (or (<= N (+ 2 i)) (<= (+ i 4) N) (<= l (+ j 1)) (<= l M) (= (+ (- 1) N) l) (< 3 N)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 3 N)) (or (<= N (+ 2 i)) (<= (+ i 4) N) (= l 0) (< 0 l) (< 3 N) (< M (+ l 1))) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 143194#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 143193#(or (= (select A l) (select B l)) (< j M) (< i N)), 143190#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< i N)), 143192#(or (= (select A l) (select B l)) (< j M) (< k N)), 143189#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 143188#(or (= (select A l) (select B l)) (< i N)), 143196#(and (or (= l k) (<= (+ 2 k) N) (= l 0) (<= 2 M) (< i N) (< M (+ l 1))) (or (= l k) (<= j 0) (< i N) (< M (+ l 1))) (or (= l k) (<= l (+ j 1)) (<= l M) (= j 0) (< i N)) (or (= l k) (<= l (+ j 1)) (<= (+ 2 k) N) (<= l M) (<= 2 M) (< i N)) (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (<= 2 M) (not (= (+ l (* (- 1) M)) 0)) (< i N) (<= M j)) (or (= l k) (not (<= l 0)) (= j 0) (< i N) (< M (+ l 1))) (or (= l k) (not (= l 0)) (< i N) (= l j)) (or (= (select A l) (select B l)) (= l k) (= j 0) (not (= (+ l (* (- 1) M)) 0)) (< i N) (<= M j))), 143195#(and (or (= l k) (<= (+ 2 k) N) (= l 0) (<= (+ j 1) M) (< i N) (< M (+ l 1))) (or (= l k) (<= (+ 2 k) N) (= l 0) (<= l M) (<= (+ j 1) M) (< i N)) (or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M) (< i N))), 143197#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (<= 3 N) (<= N i)) (or (<= N i) (= l 0) (<= (+ 2 i) N) (< 0 l) (< 3 N) (< M (+ l 1))) (or (<= l (+ j 1)) (<= N i) (<= l M) (= (+ (- 1) N) l) (<= (+ 2 i) N) (< 3 N)))] [2022-03-15 22:17:05,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:17:05,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:05,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:17:05,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:17:05,172 INFO L87 Difference]: Start difference. First operand 1569 states and 6950 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:10,739 INFO L93 Difference]: Finished difference Result 2201 states and 8989 transitions. [2022-03-15 22:17:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:17:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:10,744 INFO L225 Difference]: With dead ends: 2201 [2022-03-15 22:17:10,744 INFO L226 Difference]: Without dead ends: 2181 [2022-03-15 22:17:10,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1211, Invalid=7161, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 22:17:10,745 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:10,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:17:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-03-15 22:17:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1601. [2022-03-15 22:17:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 4.423125) internal successors, (7077), 1600 states have internal predecessors, (7077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 7077 transitions. [2022-03-15 22:17:10,774 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 7077 transitions. Word has length 17 [2022-03-15 22:17:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:10,774 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 7077 transitions. [2022-03-15 22:17:10,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 7077 transitions. [2022-03-15 22:17:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:10,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:10,778 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:10,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-15 22:17:10,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:10,978 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 941746607, now seen corresponding path program 46 times [2022-03-15 22:17:10,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:10,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877501140] [2022-03-15 22:17:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:11,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:11,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877501140] [2022-03-15 22:17:11,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877501140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:11,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276818511] [2022-03-15 22:17:11,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:11,466 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:11,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 22:17:11,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:11,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:11,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:17:11,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:11,638 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 22:17:11,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:11,672 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 20 treesize of output 22 [2022-03-15 22:17:11,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:11,763 INFO L353 Elim1Store]: treesize reduction 38, result has 25.5 percent of original size [2022-03-15 22:17:11,763 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:17:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:11,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:11,907 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:17:11,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:17:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:12,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276818511] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:12,073 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:12,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:17:12,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943672897] [2022-03-15 22:17:12,073 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:12,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:12,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 71 transitions. [2022-03-15 22:17:12,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:14,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [148837#(and (or (= (select A l) (select B l)) (< k N) (< i N) (= l j)) (or (= l 0) (<= l M) (not (= l j)) (< k N) (< i N)) (or (= l 0) (not (= l j)) (< k N) (< i N) (< M (+ l 1)))), 148834#(or (= (select A l) (select B l)) (< k N) (< i N)), 148835#(and (or (<= N i) (< (+ i 1) N) (= l 0) (not (<= l 0)) (= (+ l 1) N) (< M (+ l 1))) (or (<= N i) (< (+ i 1) N) (= l 0) (<= i 2) (= (+ l 1) N) (< M (+ l 1))) (or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N) (= l 0) (<= l M) (not (= (+ j 1) N))) (or (<= N i) (< (+ i 1) N) (not (= l 0)) (= (+ l 1) N) (= l j)) (or (<= N i) (< (+ i 1) N) (<= i 2) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N i) (< (+ i 1) N) (= l 0) (= (+ l 1) N) (= M k)) (or (<= N i) (< (+ i 1) N) (= l 0) (not (= (+ j 1) N)) (= M k)) (or (<= N i) (< (+ i 1) N) (= l 0) (not (<= l 0)) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N) (= l 0) (<= l M) (= (+ l 1) N)) (or (<= N i) (< (+ i 1) N) (not (= M l)) (= l 0) (not (= N (+ k 1))) (not (= (+ j 1) N)))), 148839#(and (or (<= N (+ 2 i)) (not (= M l)) (= l 0) (not (= N (+ k 1))) (< (+ 3 i) N) (not (= (+ j 1) N))) (or (<= N (+ 2 i)) (= l 0) (< (+ 3 i) N) (not (= (+ j 1) N)) (= M k)) (or (<= N (+ 2 i)) (= l 0) (not (<= l 0)) (< (+ 3 i) N) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N (+ 2 i)) (= l 0) (< (+ 3 i) N) (<= i 0) (= (+ l 1) N) (< M (+ l 1))) (or (<= N (+ 2 i)) (= l 0) (< (+ 3 i) N) (= (+ l 1) N) (= M k)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (not (= l 0)) (= (+ l 1) N) (= l j)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= i 0) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N (+ 2 i)) (<= (+ 2 l) N) (= l 0) (<= l M) (< (+ 3 i) N) (= (+ l 1) N)) (or (<= N (+ 2 i)) (= l 0) (not (<= l 0)) (< (+ 3 i) N) (= (+ l 1) N) (< M (+ l 1))) (or (<= N (+ 2 i)) (<= (+ 2 l) N) (= l 0) (<= l M) (< (+ 3 i) N) (not (= (+ j 1) N)))), 148831#(or (= (select A l) (select B l)) (< k N)), 148836#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= l 0) (not (= (+ j 1) N)) (= M k)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= l 0) (not (<= l 0)) (= (+ l 1) N) (< M (+ l 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N) (= l 0) (<= l M) (not (= (+ j 1) N))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= l 0) (not (<= l 0)) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= l 0) (= (+ l 1) N) (= M k)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= M l)) (= l 0) (not (= N (+ k 1))) (not (= (+ j 1) N))) (or (<= N (+ i 1)) (<= i 1) (< (+ 2 i) N) (= l 0) (= (+ l 1) N) (< M (+ l 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= l 0)) (= (+ l 1) N) (= l j)) (or (<= N (+ i 1)) (<= i 1) (< (+ 2 i) N) (not (= (+ j 1) N)) (< M (+ l 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N) (= l 0) (<= l M) (= (+ l 1) N))), 148833#(and (or (= l 0) (not (= l j)) (< i N) (< M (+ l 1))) (or (= l 0) (<= l M) (not (= l j)) (< i N)) (or (= (select A l) (select B l)) (< i N) (= l j))), 148838#(and (or (not (< k N)) (= l 0) (not (= l j)) (< (+ k 1) N) (< i N) (< M (+ l 1))) (or (= l k) (<= (+ 2 k) N) (= l 0) (<= N k) (< i N) (< M (+ l 1))) (or (not (< k N)) (= l 0) (<= l M) (not (= l j)) (< (+ k 1) N) (< i N)) (or (= l k) (<= (+ 2 k) N) (= l 0) (<= N k) (<= (+ l k 1) (+ N M)) (< i N)) (or (not (< k N)) (= (select A l) (select B l)) (= l k) (< (+ k 1) N) (< i N) (= l j)) (or (= l k) (<= (+ 2 k) N) (<= N k) (not (= l 0)) (< i N) (= l j))), 148832#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:17:14,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:17:14,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:17:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:17:14,621 INFO L87 Difference]: Start difference. First operand 1601 states and 7077 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:21,282 INFO L93 Difference]: Finished difference Result 2095 states and 8397 transitions. [2022-03-15 22:17:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:17:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:21,286 INFO L225 Difference]: With dead ends: 2095 [2022-03-15 22:17:21,286 INFO L226 Difference]: Without dead ends: 2061 [2022-03-15 22:17:21,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=724, Invalid=4532, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:17:21,287 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:21,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-03-15 22:17:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1610. [2022-03-15 22:17:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 4.422001243008079) internal successors, (7115), 1609 states have internal predecessors, (7115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 7115 transitions. [2022-03-15 22:17:21,312 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 7115 transitions. Word has length 17 [2022-03-15 22:17:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:21,312 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 7115 transitions. [2022-03-15 22:17:21,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 7115 transitions. [2022-03-15 22:17:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:21,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:21,315 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:21,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:21,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 22:17:21,516 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1958959979, now seen corresponding path program 47 times [2022-03-15 22:17:21,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:21,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426105130] [2022-03-15 22:17:21,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:21,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:21,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:21,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426105130] [2022-03-15 22:17:21,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426105130] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:21,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178277239] [2022-03-15 22:17:21,929 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:21,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:21,930 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:21,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 22:17:21,976 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:17:21,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:21,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:17:21,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:22,067 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 22:17:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,109 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 22:17:22,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,149 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 29 treesize of output 34 [2022-03-15 22:17:22,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:22,311 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 31 treesize of output 36 [2022-03-15 22:17:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:22,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:22,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:22,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:22,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2022-03-15 22:17:22,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 214 treesize of output 210 [2022-03-15 22:17:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:22,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178277239] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:22,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:22,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 22:17:22,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497049216] [2022-03-15 22:17:22,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:22,956 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:22,960 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 75 transitions. [2022-03-15 22:17:22,960 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:24,043 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [154358#(and (or (= M l) (<= N i) (not (= (+ i 1) M)) (not (= l 0)) (not (= k j))) (or (= l k) (<= N i) (not (= M l)) (not (= (+ i 1) M))) (or (= M l) (<= N i) (= l 0) (not (= (+ i 1) M)) (not (= k 1)) (<= (+ 2 M i) (+ N l))) (or (= l 1) (= M l) (<= N i) (= l 0) (not (= (+ i 1) M)) (<= (+ 2 M i) (+ N l))) (or (<= N i) (= j 0)) (or (< i M) (<= i 1) (<= N i)) (or (<= N i) (<= l M) (not (= (+ i 1) M)) (<= (+ l i) N)) (or (<= M (+ i 1)) (<= (+ M 1) N) (<= N i))), 154354#(or (= (select A l) (select B l)) (= l k) (< j M) (not (< i N)) (<= (+ 2 i) N) (= l i)), 154360#(and (or (<= N (+ i 1)) (<= (+ l i 1) N) (not (= M (+ 2 i))) (<= l M)) (or (<= N (+ i 1)) (<= (+ M 1) N) (<= M (+ 2 i))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= M l) (not (= M (+ 2 i))) (= l 0) (not (= k 1)) (<= (+ 3 M i) (+ N l))) (or (< (+ i 1) M) (<= N (+ i 1)) (<= i 0)) (or (<= N (+ i 1)) (= M l) (not (= M (+ 2 i))) (not (= l 0)) (not (= k j))) (or (<= N (+ i 1)) (= l 1) (= M l) (not (= M (+ 2 i))) (= l 0) (<= (+ 3 M i) (+ N l))) (or (<= N (+ i 1)) (= l k) (not (= M (+ 2 i))) (not (= M l)))), 154322#(or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ i 1) N)), 154350#(or (= (select A l) (select B l)) (< i N)), 154353#(or (= (select A l) (select B l)) (< j M) (< i N)), 154351#(or (= (select A l) (select B l)) (= l k) (not (< i N)) (<= (+ 2 i) N) (= l i)), 154357#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (= l j) (= (+ i 1) l)), 154352#(or (= (select A l) (select B l)) (= l k) (< j M)), 154355#(or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< i N)) (not (< j M)) (<= (+ 2 i) N) (= l i) (= l j)), 154356#(or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (<= N i) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1)) (= l i) (= l j)), 154359#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)), 154349#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:17:24,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:17:24,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:17:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:17:24,043 INFO L87 Difference]: Start difference. First operand 1610 states and 7115 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:28,510 INFO L93 Difference]: Finished difference Result 3018 states and 11850 transitions. [2022-03-15 22:17:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 22:17:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:28,517 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 22:17:28,517 INFO L226 Difference]: Without dead ends: 2926 [2022-03-15 22:17:28,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1165, Invalid=4841, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 22:17:28,518 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 354 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:28,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:17:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2022-03-15 22:17:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1752. [2022-03-15 22:17:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 4.4357509994288975) internal successors, (7767), 1751 states have internal predecessors, (7767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 7767 transitions. [2022-03-15 22:17:28,555 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 7767 transitions. Word has length 17 [2022-03-15 22:17:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:28,555 INFO L470 AbstractCegarLoop]: Abstraction has 1752 states and 7767 transitions. [2022-03-15 22:17:28,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 7767 transitions. [2022-03-15 22:17:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:28,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:28,558 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:28,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:28,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:28,759 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1274806107, now seen corresponding path program 48 times [2022-03-15 22:17:28,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:28,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168838400] [2022-03-15 22:17:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:29,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:29,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168838400] [2022-03-15 22:17:29,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168838400] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:29,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289301128] [2022-03-15 22:17:29,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:17:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:29,131 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:29,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 22:17:29,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:17:29,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:29,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:17:29,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:29,273 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 22:17:29,301 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 16 treesize of output 18 [2022-03-15 22:17:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:29,352 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 21 treesize of output 26 [2022-03-15 22:17:29,400 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:17:29,401 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:17:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:29,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:29,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:29,649 INFO L353 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2022-03-15 22:17:29,649 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 29 treesize of output 59 [2022-03-15 22:17:29,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:29,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 104 treesize of output 102 [2022-03-15 22:17:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:29,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289301128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:29,883 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:29,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 22:17:29,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62800645] [2022-03-15 22:17:29,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:29,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:29,886 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 22:17:29,886 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:30,990 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [161095#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (not (< (+ i 1) N)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (not (= l k)))), 161086#(or (= (select A l) (select B l)) (< k N)), 161093#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (not (= l k)) (= (+ i 1) l))), 161088#(or (= (select A l) (select B l)) (< j M) (= l i)), 161085#(or (= (select A l) (select B l)) (< j M)), 161096#(and (or (<= N (+ i 1)) (<= i 0) (not (<= M (+ i 1)))) (or (<= N (+ i 1)) (not (= M (+ 2 i))) (not (= k 1)) (<= 2 l) (= l j) (< M (+ l 1))) (or (<= N (+ i 1)) (<= 0 i) (<= M (+ 2 i))) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (not (= M (+ 2 i))) (<= l M)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= l 1) (not (= M (+ 2 i))) (<= 2 l) (= l j) (< M (+ l 1))) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M (+ 2 i))) (<= l M)) (or (<= N (+ i 1)) (= l 1) (not (= M (+ 2 i))) (<= 2 l) (not (= k j)) (< M (+ l 1)))), 161090#(and (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (= l i)) (or (<= (+ 2 k) N) (< j M) (not (= l k)) (= l i))), 161094#(and (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ i 1) M))) (or (= l 1) (<= N i) (not (= (+ i 1) M)) (<= 2 l) (not (= k j)) (< M (+ l 1))) (or (<= M (+ i 1)) (<= N i) (<= 1 i)) (or (<= i 1) (<= N i) (not (<= M i))) (or (<= N i) (not (= (+ i 1) M)) (not (= k 1)) (<= 2 l) (= l j) (< M (+ l 1))) (or (<= N i) (= j 0)) (or (= l 1) (<= N i) (not (= (+ i 1) M)) (<= 2 l) (= l j) (< M (+ l 1))) (or (= (+ (* (- 1) k) M) 0) (<= N i) (<= l M) (not (= (+ i 1) M)))), 161092#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 2 j) M) (= l i) (= l j)) (or (not (< (+ j 1) M)) (<= (+ 2 k) N) (< (+ 2 j) M) (not (= l k)) (= l i))), 161089#(or (= (select A l) (select B l)) (< j M) (< k N) (= l i)), 161091#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (not (= l k)) (= l i)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (= l i) (= l j))), 161087#(or (= (select A l) (select B l)) (< j M) (< k N))] [2022-03-15 22:17:30,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:17:30,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:17:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:17:30,991 INFO L87 Difference]: Start difference. First operand 1752 states and 7767 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:38,160 INFO L93 Difference]: Finished difference Result 2540 states and 9965 transitions. [2022-03-15 22:17:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:17:38,160 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:38,165 INFO L225 Difference]: With dead ends: 2540 [2022-03-15 22:17:38,165 INFO L226 Difference]: Without dead ends: 2514 [2022-03-15 22:17:38,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1023, Invalid=6287, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 22:17:38,166 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:38,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-03-15 22:17:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1756. [2022-03-15 22:17:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 4.434188034188034) internal successors, (7782), 1755 states have internal predecessors, (7782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 7782 transitions. [2022-03-15 22:17:38,192 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 7782 transitions. Word has length 17 [2022-03-15 22:17:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:38,192 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 7782 transitions. [2022-03-15 22:17:38,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 7782 transitions. [2022-03-15 22:17:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:38,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:38,196 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:38,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:38,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 22:17:38,396 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 735569463, now seen corresponding path program 49 times [2022-03-15 22:17:38,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:38,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642709977] [2022-03-15 22:17:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:38,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:38,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642709977] [2022-03-15 22:17:38,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642709977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:38,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157155241] [2022-03-15 22:17:38,821 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:17:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:38,822 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:38,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 22:17:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:38,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:17:38,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:38,953 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 8 treesize of output 7 [2022-03-15 22:17:38,980 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 14 treesize of output 16 [2022-03-15 22:17:39,009 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 16 treesize of output 18 [2022-03-15 22:17:39,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:39,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:39,136 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 23 treesize of output 28 [2022-03-15 22:17:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:39,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:39,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:39,335 INFO L353 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-03-15 22:17:39,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2022-03-15 22:17:39,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:39,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 22:17:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:39,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157155241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:39,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:39,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 22:17:39,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773684837] [2022-03-15 22:17:39,505 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:39,506 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:39,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 77 transitions. [2022-03-15 22:17:39,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:40,604 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [167340#(or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ i 1) N)), 167375#(and (or (= M l) (<= N i) (= l 0) (not (= k 1)) (<= (+ 2 M i) (+ N l))) (or (= l k) (<= N i) (not (= M l))) (or (= M l) (<= N i) (not (= (+ i 1) M)) (not (= l 0)) (not (= k j))) (or (<= N i) (= j 0)) (or (= l 1) (= M l) (<= N i) (= l 0) (<= (+ 2 M i) (+ N l))) (or (<= M (+ i 1)) (<= (+ M 1) N) (= M l) (<= N i) (not (= l 0))) (or (< i M) (= M l) (<= i 1) (<= N i) (not (= l 0))) (or (<= N i) (<= l M) (<= (+ l i) N))), 167376#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)), 167370#(or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (= l j)), 167371#(or (= (select A l) (select B l)) (< j M) (< i N)), 167373#(or (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (<= N i) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1)) (= l i) (= l j)), 167369#(or (= (select A l) (select B l)) (= l k) (< j M)), 167344#(or (< (+ j 1) M) (= l k) (not (< j M)) (<= (+ i 1) N) (= (select A l) (select (store B j (select A j)) l))), 167374#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (= l j) (= (+ i 1) l)), 167372#(or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< i N)) (not (< j M)) (<= (+ 2 i) N) (= l i) (= l j)), 167377#(and (or (<= N (+ i 1)) (= M l) (= l 0) (not (= k 1)) (<= (+ 3 M i) (+ N l))) (or (<= N (+ i 1)) (= l 1) (= M l) (= l 0) (<= (+ 3 M i) (+ N l))) (or (<= N (+ i 1)) (<= (+ l i 1) N) (<= l M)) (or (< (+ i 1) M) (<= N (+ i 1)) (= M l) (not (= l 0)) (<= i 0)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= M l) (not (= M (+ 2 i))) (not (= l 0)) (not (= k j))) (or (<= N (+ i 1)) (<= (+ M 1) N) (= M l) (<= M (+ 2 i)) (not (= l 0))) (or (<= N (+ i 1)) (= l k) (not (= M l)))), 167367#(or (= (select A l) (select B l)) (< j M)), 167368#(or (= (select A l) (select B l)) (< i N))] [2022-03-15 22:17:40,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:17:40,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:17:40,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:17:40,605 INFO L87 Difference]: Start difference. First operand 1756 states and 7782 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:47,241 INFO L93 Difference]: Finished difference Result 3309 states and 13110 transitions. [2022-03-15 22:17:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 22:17:47,241 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:47,248 INFO L225 Difference]: With dead ends: 3309 [2022-03-15 22:17:47,249 INFO L226 Difference]: Without dead ends: 3211 [2022-03-15 22:17:47,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1344, Invalid=6488, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:17:47,249 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 357 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:47,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 0 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:17:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2022-03-15 22:17:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 1836. [2022-03-15 22:17:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1835 states have (on average 4.445231607629427) internal successors, (8157), 1835 states have internal predecessors, (8157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 8157 transitions. [2022-03-15 22:17:47,285 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 8157 transitions. Word has length 17 [2022-03-15 22:17:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:47,285 INFO L470 AbstractCegarLoop]: Abstraction has 1836 states and 8157 transitions. [2022-03-15 22:17:47,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 8157 transitions. [2022-03-15 22:17:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:47,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:47,289 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:47,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:47,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 22:17:47,490 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 468299601, now seen corresponding path program 50 times [2022-03-15 22:17:47,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:47,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993281713] [2022-03-15 22:17:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:47,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:47,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993281713] [2022-03-15 22:17:47,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993281713] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:47,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017550921] [2022-03-15 22:17:47,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:47,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:47,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:47,770 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:47,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 22:17:47,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:47,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:47,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:17:47,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:47,905 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 8 treesize of output 7 [2022-03-15 22:17:47,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:47,973 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 16 treesize of output 18 [2022-03-15 22:17:48,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:48,021 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:17:48,021 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:17:48,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:48,126 INFO L353 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2022-03-15 22:17:48,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 33 [2022-03-15 22:17:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:48,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:48,387 INFO L353 Elim1Store]: treesize reduction 20, result has 75.3 percent of original size [2022-03-15 22:17:48,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 27 treesize of output 78 [2022-03-15 22:17:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:48,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017550921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:48,586 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:48,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:17:48,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379208279] [2022-03-15 22:17:48,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:48,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:48,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 22:17:48,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:49,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [174588#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 174593#(and (or (<= (+ l 1) N) (= l k) (< j M) (= l 0)) (or (= l k) (< j M) (= l 0) (<= (+ k 1) l)) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= l 0)) (= l i)) (or (= l k) (< j M) (= l 0) (not (<= l 0))) (or (< j M) (<= (+ k 1) i))), 174598#(and (or (<= N (+ i 1)) (= M k)) (or (<= N (+ i 1)) (<= (+ l 1) N) (= M l) (<= (+ l 1) M)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (= M l) (= l 0) (not (<= l 0)))), 174590#(or (= (select A l) (select B l)) (< j M) (< k N)), 174597#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (not (< j M)) (<= k (+ i 1))) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (<= l 0)) (not (< j M))) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (< j M)) (<= (+ k 1) l)) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< (+ i 1) N)) (= l 0) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (not (< j M)) (not (= l 0)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l))), 174589#(or (= (select A l) (select B l)) (< k N)), 174595#(and (or (< (+ j 1) M) (= l k) (= l 0) (not (<= l 0)) (not (< i N)) (not (< j M))) (or (<= (+ l 1) N) (< (+ j 1) M) (= l 0) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< i N)) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (<= k i) (not (< i N)) (not (< j M))) (or (< (+ j 1) M) (= l k) (= l 0) (not (< i N)) (not (< j M)) (<= (+ k 1) l))), 174596#(and (or (= M l) (<= N i) (= l 0) (not (<= l 0))) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (= M l) (<= N i) (<= (+ l 1) M)) (or (<= N i) (<= 1 i)) (or (<= N i) (= M k))), 174592#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (<= (+ l 1) N) (= (select A l) (select B l)) (= l k) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 174594#(and (or (<= (+ l 1) N) (< (+ j 1) M) (= l k) (= l 0) (not (< j M))) (or (< (+ j 1) M) (= l k) (= l 0) (not (< j M)) (<= (+ k 1) l)) (or (< (+ j 1) M) (= l k) (= l 0) (not (<= l 0)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (not (= l 0)) (= l i) (= l j)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M)))), 174591#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (< 0 l) (= l i))), 174587#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:17:49,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:17:49,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:17:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:17:49,862 INFO L87 Difference]: Start difference. First operand 1836 states and 8157 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:54,302 INFO L93 Difference]: Finished difference Result 2775 states and 11043 transitions. [2022-03-15 22:17:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 22:17:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:17:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:54,307 INFO L225 Difference]: With dead ends: 2775 [2022-03-15 22:17:54,307 INFO L226 Difference]: Without dead ends: 2756 [2022-03-15 22:17:54,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2989 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1643, Invalid=8059, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:17:54,308 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:54,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:17:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-03-15 22:17:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1842. [2022-03-15 22:17:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 4.44106463878327) internal successors, (8176), 1841 states have internal predecessors, (8176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 8176 transitions. [2022-03-15 22:17:54,337 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 8176 transitions. Word has length 17 [2022-03-15 22:17:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:54,337 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 8176 transitions. [2022-03-15 22:17:54,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 8176 transitions. [2022-03-15 22:17:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:17:54,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:54,341 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:54,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:54,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 22:17:54,541 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1138478981, now seen corresponding path program 18 times [2022-03-15 22:17:54,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:54,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018024672] [2022-03-15 22:17:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:54,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:54,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018024672] [2022-03-15 22:17:54,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018024672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:54,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362361654] [2022-03-15 22:17:54,815 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:17:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:54,816 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:17:54,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 22:17:54,863 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:17:54,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:54,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:17:54,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:54,992 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 22:17:55,031 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:17:55,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:17:55,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:55,154 INFO L353 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2022-03-15 22:17:55,155 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-03-15 22:17:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:55,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:55,199 INFO L353 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-03-15 22:17:55,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 41 [2022-03-15 22:17:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:55,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:55,367 INFO L353 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-03-15 22:17:55,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 66 [2022-03-15 22:17:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:55,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362361654] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:55,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:55,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:17:55,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494761217] [2022-03-15 22:17:55,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:55,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:55,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 87 transitions. [2022-03-15 22:17:55,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:57,169 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [181301#(and (or (<= N (+ i 1)) (< 0 i) (= l (+ 2 i)) (<= (+ l 1) (+ N i))) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (< 0 i) (= l 0) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= k 0))), 181309#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M)), 181313#(and (or (< 2 i) (< j M) (= l 0) (= (+ l 1) i) (< i (+ l 1))) (or (< j M) (= k 0)) (or (<= 2 i) (< j M)) (or (< 2 i) (< j M) (= l 0) (= (+ (- 1) i) l) (<= (+ 3 l) (+ N i)) (= l i))), 181300#(and (or (<= N i) (= l 0) (< i l) (< 1 i) (= l i)) (or (<= N i) (<= (+ 2 l) (+ N i)) (< 1 i) (= (+ i 1) l)) (or (<= N i) (<= 1 i)) (or (<= N i) (= k 0))), 181312#(and (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (< 0 l) (= l i)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (= l i) (<= (+ 2 l k) (+ N i))) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (< i (+ l 1)))), 181311#(and (or (= l k) (< j M) (= l 0) (< (+ 2 k) N) (= (+ l 1) N)) (or (<= (+ 2 k) N) (< j M)) (or (= (select A l) (select B l)) (= l k) (< j M) (< (+ 2 k) N) (= (+ l 1) N))), 181315#(and (or (<= N (+ i 1)) (<= 0 i) (< j M)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< 0 i) (< j M) (= l 0) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (< 0 i) (< j M) (= l (+ 2 i)) (<= (+ l 1) (+ N i)))), 181316#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (not (= M 0)) (<= 1 i)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (<= N i) (<= (+ 2 l) (+ N i)) (not (= M 0)) (< 1 i) (= (+ i 1) l)) (or (<= N i) (= l 0) (not (= M 0)) (< i l) (< 1 i) (= l i))), 181310#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M) (< i N)), 181302#(or (= (select A l) (select B l)) (< i N)), 181308#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< i N)), 181305#(or (= (select A l) (select B l)) (< j M) (< k N)), 181307#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 181314#(and (or (<= N i) (< j M) (<= 1 i)) (or (<= N i) (< j M) (= l 0) (= (+ l 1) (+ i 1)) (< i l) (< 1 i)) (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (<= (+ 2 l) (+ N i)) (< 1 i) (= (+ i 1) l))), 181306#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 181304#(or (= (select A l) (select B l)) (< j M) (< i N)), 181317#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (< 0 i) (= l 0) (not (= M 0)) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (< 0 i) (not (= M 0)) (= l (+ 2 i)) (<= (+ l 1) (+ N i))) (or (<= N (+ i 1)) (<= 0 i) (not (= M 0))) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (<= N (+ i 1)) (= M 0) (= j 0))), 181303#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:17:57,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:17:57,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:17:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1775, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:17:57,170 INFO L87 Difference]: Start difference. First operand 1842 states and 8176 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:00,476 INFO L93 Difference]: Finished difference Result 2371 states and 9807 transitions. [2022-03-15 22:18:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 22:18:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:00,481 INFO L225 Difference]: With dead ends: 2371 [2022-03-15 22:18:00,481 INFO L226 Difference]: Without dead ends: 2362 [2022-03-15 22:18:00,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1244, Invalid=6588, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:18:00,482 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:00,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-03-15 22:18:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1851. [2022-03-15 22:18:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1850 states have (on average 4.440540540540541) internal successors, (8215), 1850 states have internal predecessors, (8215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 8215 transitions. [2022-03-15 22:18:00,509 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 8215 transitions. Word has length 17 [2022-03-15 22:18:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:00,509 INFO L470 AbstractCegarLoop]: Abstraction has 1851 states and 8215 transitions. [2022-03-15 22:18:00,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 8215 transitions. [2022-03-15 22:18:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:00,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:00,513 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:00,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:00,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 22:18:00,713 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:00,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash -732918821, now seen corresponding path program 19 times [2022-03-15 22:18:00,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:00,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708282172] [2022-03-15 22:18:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:00,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:00,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708282172] [2022-03-15 22:18:00,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708282172] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:00,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967584196] [2022-03-15 22:18:00,994 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:00,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:00,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:00,995 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:00,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 22:18:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:01,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:18:01,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:01,168 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 22:18:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,199 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 22:18:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,240 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 29 treesize of output 34 [2022-03-15 22:18:01,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:01,323 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 31 treesize of output 36 [2022-03-15 22:18:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:01,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:01,484 INFO L353 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2022-03-15 22:18:01,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 45 [2022-03-15 22:18:01,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:01,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 104 treesize of output 102 [2022-03-15 22:18:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:01,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967584196] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:01,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:01,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:18:01,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901473133] [2022-03-15 22:18:01,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:01,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:01,719 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 75 transitions. [2022-03-15 22:18:01,719 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:03,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [187605#(or (= (select A l) (select B l)) (= l k) (<= (+ 2 k) N) (< j M)), 187609#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< j M) (< i N)), 187606#(or (= (select A l) (select B l)) (< i N)), 187613#(and (or (<= N i) (< j M) (<= 1 i)) (or (<= N i) (< j M) (= l 0) (= (+ l 1) (+ i 1)) (< i l) (< 1 i)) (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (<= (+ 2 l) (+ N i)) (< 1 i) (= (+ i 1) l))), 187608#(or (= (select A l) (select B l)) (< j M) (< i N)), 187607#(or (= (select A l) (select B l)) (<= (+ k 1) N) (< i N)), 187615#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (not (= M 0)) (<= 1 i)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (<= N i) (<= (+ 2 l) (+ N i)) (not (= M 0)) (< 1 i) (= (+ i 1) l)) (or (<= N i) (= l 0) (not (= M 0)) (< i l) (< 1 i) (= l i))), 187602#(or (= (select A l) (select B l)) (< j M) (< k N)), 187611#(and (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (< 0 l) (= l i)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (= l i) (<= (+ 2 l k) (+ N i))) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (< i (+ l 1)))), 187614#(and (or (<= N (+ i 1)) (<= 0 i) (< j M)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< 0 i) (< j M) (= l 0) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (< 0 i) (< j M) (= l (+ 2 i)) (<= (+ l 1) (+ N i)))), 187601#(or (= (select A l) (select B l)) (< j M)), 187616#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (< 0 i) (= l 0) (not (= M 0)) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (< 0 i) (not (= M 0)) (= l (+ 2 i)) (<= (+ l 1) (+ N i))) (or (<= N (+ i 1)) (<= 0 i) (not (= M 0))) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (<= N (+ i 1)) (= M 0) (= j 0))), 187610#(and (or (= (select A l) (select B l)) (< j M) (not (= k i)) (<= (+ l k 1) (+ N i)) (= l i)) (or (= (select A l) (select B l)) (< j M) (not (= k i)) (< 0 l) (= l i)) (or (= (select A l) (select B l)) (< j M) (not (= k i)) (< i (+ l 1))) (or (< j M) (< k (+ i 1)))), 187603#(and (or (<= N i) (= l 0) (< i l) (< 1 i) (= l i)) (or (<= N i) (<= (+ 2 l) (+ N i)) (< 1 i) (= (+ i 1) l)) (or (<= N i) (<= 1 i)) (or (<= N i) (= k 0))), 187604#(and (or (<= N (+ i 1)) (< 0 i) (= l (+ 2 i)) (<= (+ l 1) (+ N i))) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (< 0 i) (= l 0) (< (+ i 1) l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= k 0))), 187612#(and (or (< 2 i) (< j M) (= l 0) (= (+ l 1) i) (< i (+ l 1))) (or (< j M) (= k 0)) (or (<= 2 i) (< j M)) (or (< 2 i) (< j M) (= l 0) (= (+ (- 1) i) l) (<= (+ 3 l) (+ N i)) (= l i)))] [2022-03-15 22:18:03,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:18:03,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:18:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1638, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:18:03,167 INFO L87 Difference]: Start difference. First operand 1851 states and 8215 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:07,915 INFO L93 Difference]: Finished difference Result 2385 states and 9781 transitions. [2022-03-15 22:18:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 22:18:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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 22:18:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:07,921 INFO L225 Difference]: With dead ends: 2385 [2022-03-15 22:18:07,921 INFO L226 Difference]: Without dead ends: 2376 [2022-03-15 22:18:07,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2891 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1584, Invalid=8922, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 22:18:07,922 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:07,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-03-15 22:18:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1850. [2022-03-15 22:18:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 4.438074634937804) internal successors, (8206), 1849 states have internal predecessors, (8206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 8206 transitions. [2022-03-15 22:18:07,958 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 8206 transitions. Word has length 17 [2022-03-15 22:18:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:07,958 INFO L470 AbstractCegarLoop]: Abstraction has 1850 states and 8206 transitions. [2022-03-15 22:18:07,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 8206 transitions. [2022-03-15 22:18:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:07,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:07,962 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:07,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:08,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:08,162 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1236401691, now seen corresponding path program 20 times [2022-03-15 22:18:08,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:08,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168138903] [2022-03-15 22:18:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:08,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:08,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168138903] [2022-03-15 22:18:08,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168138903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:08,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466940877] [2022-03-15 22:18:08,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:08,439 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:08,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 22:18:08,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:08,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:08,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:18:08,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:08,619 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 22:18:08,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,646 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 22:18:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,682 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 29 treesize of output 34 [2022-03-15 22:18:08,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:08,758 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 31 treesize of output 36 [2022-03-15 22:18:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:08,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:09,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:09,032 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:18:09,032 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 31 treesize of output 51 [2022-03-15 22:18:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:09,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466940877] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:09,171 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:09,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:18:09,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600787271] [2022-03-15 22:18:09,172 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:09,172 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:09,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 68 transitions. [2022-03-15 22:18:09,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:10,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [193948#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (< 0 l) (= l i))), 193956#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (not (= M 0)) (<= 1 i)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M)) (or (<= N i) (= l 0) (not (= M 0)) (< 1 i) (<= 2 l) (= l i)) (or (<= (+ l 1) N) (<= N i) (not (= M 0)) (< 1 i))), 193957#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (<= 0 i) (not (= M 0))) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 0 i) (not (= M 0))) (or (<= N (+ i 1)) (< 0 i) (= l 0) (not (= M 0)) (<= 2 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= M 0) (= j 0))), 193953#(and (or (<= (+ l 1) N) (< 2 i) (< j M) (= l 0) (= (+ (- 1) i) l)) (or (< j M) (= k 0)) (or (<= 2 i) (< j M)) (or (< 2 i) (< j M) (= l 0) (= (+ (- 1) i) l) (<= 2 l))), 193954#(and (or (<= N i) (< j M) (<= 1 i)) (or (<= (+ l 1) N) (<= N i) (< j M) (< 1 i)) (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (= l 0) (< 1 i) (<= 2 l) (= l i))), 193945#(or (= (select A l) (select B l)) (< j M)), 193952#(and (or (<= N (+ i 1)) (< 0 i) (= l 0) (<= 2 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 0 i)) (or (<= N (+ i 1)) (= k 0))), 193946#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 193949#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (<= (+ l 1) N) (= (select A l) (select B l)) (= l k) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 193950#(and (or (<= (+ l 1) N) (<= (+ 2 k) i) (= l k) (< j M) (= l 0)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (not (<= l 0))) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (<= (+ k 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i))), 193944#(or (= (select A l) (select B l)) (< k N)), 193951#(and (or (<= (+ l 1) N) (<= N i) (< 1 i)) (or (<= N i) (<= 1 i)) (or (<= N i) (= l 0) (< 1 i) (<= 2 l) (= l i)) (or (<= N i) (= k 0))), 193947#(or (= (select A l) (select B l)) (< j M) (< k N)), 193955#(and (or (<= N (+ i 1)) (<= 0 i) (< j M)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 0 i) (< j M)) (or (<= N (+ i 1)) (< 0 i) (< j M) (= l 0) (<= 2 l) (= (+ i 1) l)))] [2022-03-15 22:18:10,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:18:10,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:18:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:18:10,466 INFO L87 Difference]: Start difference. First operand 1850 states and 8206 transitions. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:15,171 INFO L93 Difference]: Finished difference Result 2352 states and 9720 transitions. [2022-03-15 22:18:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 22:18:15,171 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:15,175 INFO L225 Difference]: With dead ends: 2352 [2022-03-15 22:18:15,176 INFO L226 Difference]: Without dead ends: 2346 [2022-03-15 22:18:15,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1339, Invalid=7403, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:18:15,176 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:15,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2022-03-15 22:18:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1850. [2022-03-15 22:18:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 4.439697133585722) internal successors, (8209), 1849 states have internal predecessors, (8209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 8209 transitions. [2022-03-15 22:18:15,203 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 8209 transitions. Word has length 17 [2022-03-15 22:18:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:15,204 INFO L470 AbstractCegarLoop]: Abstraction has 1850 states and 8209 transitions. [2022-03-15 22:18:15,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 8209 transitions. [2022-03-15 22:18:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:15,207 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:15,207 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:15,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-03-15 22:18:15,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:15,408 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1306844719, now seen corresponding path program 51 times [2022-03-15 22:18:15,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:15,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181355118] [2022-03-15 22:18:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:15,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:15,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181355118] [2022-03-15 22:18:15,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181355118] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:15,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35544369] [2022-03-15 22:18:15,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:15,788 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 22:18:15,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:18:15,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:18:15,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:16,006 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 8 treesize of output 7 [2022-03-15 22:18:16,039 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:18:16,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:18:16,095 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-03-15 22:18:16,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:18:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:16,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:16,453 INFO L353 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-03-15 22:18:16,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 48 [2022-03-15 22:18:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:16,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35544369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:16,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:16,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 22:18:16,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290344256] [2022-03-15 22:18:16,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:16,745 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:16,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:18:16,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:17,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [200242#(or (= (select A l) (select B l)) (<= N i) (= l i)), 200246#(and (or (<= N (+ i 1)) (<= (+ l 1) N) (< 0 i) (not (= M (+ 2 i))) (<= l M)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (< 0 i) (not (= M (+ 2 i))) (= l 0) (= (+ i 1) l) (< M (+ l 1)))), 200244#(and (or (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (<= (+ N j) (+ M i)) (<= j l)) (or (<= j i) (< k N) (<= (+ N j) (+ M i)) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (< 0 l) (<= (+ N j) (+ M i))) (or (= (select A l) (select B l)) (not (= M i)) (<= l M) (< k N) (<= (+ N j) (+ M i))) (or (< i (+ M 1)) (< k N) (<= N (+ M 1)) (<= (+ N j) (+ M i)))), 200241#(or (= (select A l) (select B l)) (< j M) (< k N)), 200240#(or (= (select A l) (select B l)) (< k N)), 200243#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 200247#(and (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1))) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (not (= l 0)) (= l j)) (or (not (= M i)) (= l 0) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (< 0 l) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j))), 200245#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ i 1) M)) (< 1 i)) (or (<= N i) (= j 0)) (or (<= N i) (<= 1 i)) (or (<= N i) (= l 0) (not (= (+ i 1) M)) (< 1 i) (= l i) (< M (+ l 1))))] [2022-03-15 22:18:17,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:18:17,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:18:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:18:17,700 INFO L87 Difference]: Start difference. First operand 1850 states and 8209 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:21,595 INFO L93 Difference]: Finished difference Result 2416 states and 9920 transitions. [2022-03-15 22:18:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:18:21,596 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:21,601 INFO L225 Difference]: With dead ends: 2416 [2022-03-15 22:18:21,601 INFO L226 Difference]: Without dead ends: 2407 [2022-03-15 22:18:21,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=866, Invalid=5296, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 22:18:21,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:21,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2022-03-15 22:18:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1853. [2022-03-15 22:18:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 4.439524838012959) internal successors, (8222), 1852 states have internal predecessors, (8222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 8222 transitions. [2022-03-15 22:18:21,633 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 8222 transitions. Word has length 17 [2022-03-15 22:18:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:21,633 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 8222 transitions. [2022-03-15 22:18:21,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 8222 transitions. [2022-03-15 22:18:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:21,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:21,636 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:21,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:21,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:21,837 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -451538065, now seen corresponding path program 52 times [2022-03-15 22:18:21,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:21,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705958811] [2022-03-15 22:18:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:22,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:22,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705958811] [2022-03-15 22:18:22,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705958811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:22,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44255165] [2022-03-15 22:18:22,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:22,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:22,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:22,231 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 22:18:22,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:22,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:22,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:18:22,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:22,418 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 8 treesize of output 7 [2022-03-15 22:18:22,443 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 16 treesize of output 18 [2022-03-15 22:18:22,468 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 23 treesize of output 28 [2022-03-15 22:18:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:22,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:22,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:22,630 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:18:22,630 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 26 treesize of output 46 [2022-03-15 22:18:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:22,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44255165] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:22,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:22,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:18:22,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615251641] [2022-03-15 22:18:22,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:22,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:22,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:18:22,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:23,678 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [206580#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 206578#(and (or (<= N (+ i 1)) (<= (+ l 1) N) (< 0 i) (not (= M (+ 2 i))) (<= l M)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (< 0 i) (not (= M (+ 2 i))) (= l 0) (= (+ i 1) l) (< M (+ l 1)))), 206575#(or (= (select A l) (select B l)) (< k N)), 206579#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 206576#(or (= (select A l) (select B l)) (< j M) (< k N)), 206581#(and (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j)) (or (<= (+ 2 j) M) (= M l) (= l 0) (< k N) (= l j))), 206582#(and (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1)) (= l j)) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (= l j) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (not (= l 0)) (= l j)) (or (not (= M i)) (= l 0) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (< 0 l) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j))), 206577#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ i 1) M)) (< 1 i)) (or (<= N i) (= j 0)) (or (<= N i) (<= 1 i)) (or (<= N i) (= l 0) (not (= (+ i 1) M)) (< 1 i) (= l i) (< M (+ l 1))))] [2022-03-15 22:18:23,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:18:23,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:18:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:18:23,679 INFO L87 Difference]: Start difference. First operand 1853 states and 8222 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:28,586 INFO L93 Difference]: Finished difference Result 2366 states and 9763 transitions. [2022-03-15 22:18:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 22:18:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:28,592 INFO L225 Difference]: With dead ends: 2366 [2022-03-15 22:18:28,592 INFO L226 Difference]: Without dead ends: 2341 [2022-03-15 22:18:28,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=928, Invalid=6382, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 22:18:28,592 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:28,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2022-03-15 22:18:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1854. [2022-03-15 22:18:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 4.441985968699407) internal successors, (8231), 1853 states have internal predecessors, (8231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 8231 transitions. [2022-03-15 22:18:28,627 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 8231 transitions. Word has length 17 [2022-03-15 22:18:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:28,627 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 8231 transitions. [2022-03-15 22:18:28,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 8231 transitions. [2022-03-15 22:18:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:28,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:28,631 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:28,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:28,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-03-15 22:18:28,832 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1118689809, now seen corresponding path program 53 times [2022-03-15 22:18:28,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:28,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600620680] [2022-03-15 22:18:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:29,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:29,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600620680] [2022-03-15 22:18:29,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600620680] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:29,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698318429] [2022-03-15 22:18:29,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:29,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:29,164 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:29,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 22:18:29,214 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 22:18:29,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:29,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:18:29,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:29,313 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 8 treesize of output 7 [2022-03-15 22:18:29,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,353 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 20 treesize of output 22 [2022-03-15 22:18:29,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,418 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 29 treesize of output 34 [2022-03-15 22:18:29,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:29,503 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 27 treesize of output 32 [2022-03-15 22:18:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:29,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:29,735 INFO L353 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-03-15 22:18:29,736 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 3 case distinctions, treesize of input 22 treesize of output 36 [2022-03-15 22:18:29,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:29,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-03-15 22:18:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:29,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698318429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:29,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:29,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:18:29,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738523226] [2022-03-15 22:18:29,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:29,934 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:29,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 52 transitions. [2022-03-15 22:18:29,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:30,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [212887#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 212882#(or (= (select A l) (select B l)) (< k N)), 212886#(or (= (select A l) (select B l)) (< j M) (< k N)), 212883#(or (= (select A l) (select B l)) (< j M)), 212884#(and (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (<= N i) (= (+ l (* (- 1) M)) 0)) (or (<= N i) (<= 1 i)) (or (<= N i) (= M k)) (or (<= N i) (= l 0) (< 0 l) (< M (+ l 1)))), 212885#(and (or (<= N (+ i 1)) (= l 0) (< 0 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= M k)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (= (+ l (* (- 1) M)) 0))), 212888#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (not (= l 0)) (= l i)))] [2022-03-15 22:18:30,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:30,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:18:30,451 INFO L87 Difference]: Start difference. First operand 1854 states and 8231 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:33,532 INFO L93 Difference]: Finished difference Result 2361 states and 9752 transitions. [2022-03-15 22:18:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:18:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:33,537 INFO L225 Difference]: With dead ends: 2361 [2022-03-15 22:18:33,537 INFO L226 Difference]: Without dead ends: 2351 [2022-03-15 22:18:33,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=948, Invalid=4164, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:18:33,537 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:33,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2022-03-15 22:18:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1858. [2022-03-15 22:18:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 4.440495422724825) internal successors, (8246), 1857 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 8246 transitions. [2022-03-15 22:18:33,565 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 8246 transitions. Word has length 17 [2022-03-15 22:18:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:33,565 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 8246 transitions. [2022-03-15 22:18:33,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 8246 transitions. [2022-03-15 22:18:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:33,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:33,569 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:33,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:33,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:33,771 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2120450347, now seen corresponding path program 54 times [2022-03-15 22:18:33,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:33,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614892701] [2022-03-15 22:18:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:34,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:34,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614892701] [2022-03-15 22:18:34,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614892701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:34,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365349527] [2022-03-15 22:18:34,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:34,250 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:34,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 22:18:34,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:18:34,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:34,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:18:34,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:34,391 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 22:18:34,420 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:18:34,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:18:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:34,507 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:18:34,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:18:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:34,659 INFO L353 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2022-03-15 22:18:34,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 42 [2022-03-15 22:18:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:34,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:34,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:34,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:34,938 INFO L353 Elim1Store]: treesize reduction 20, result has 71.8 percent of original size [2022-03-15 22:18:34,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 70 [2022-03-15 22:18:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:35,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365349527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:35,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:35,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:18:35,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008905969] [2022-03-15 22:18:35,065 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:35,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:35,069 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:18:35,069 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:36,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [219170#(and (or (= l 0) (not (= l j)) (< i N) (< M (+ l 1))) (or (= l 0) (<= l M) (not (= l j)) (< i N)) (or (= (select A l) (select B l)) (< i N) (= l j))), 219171#(or (= (select A l) (select B l)) (< k N) (< i N)), 219172#(and (or (= (select A l) (select B l)) (< k N) (< i N) (= l j)) (or (= l 0) (<= l M) (not (= l j)) (< k N) (< i N)) (or (= l 0) (not (= l j)) (< k N) (< i N) (< M (+ l 1)))), 219167#(and (or (<= N i) (not (= (+ i 1) j)) (not (= (+ i 1) l))) (or (<= N i) (= l 0) (= M k) (= (+ i 1) l)) (or (<= (+ l 1) N) (= M l) (<= N i) (= l 0) (= (+ i 1) l)) (or (<= N i) (not (= l 0)) (= l j) (= (+ i 1) l)) (or (<= i 1) (<= N i) (= l 0) (< i l) (< M (+ l 1))) (or (<= N i) (= l 0) (< i l) (< 0 l) (< M (+ l 1)))), 219168#(and (or (<= N (+ i 1)) (<= (+ l 1) N) (= M l) (= l 0) (= l (+ 2 i))) (or (<= N (+ i 1)) (not (= l 0)) (= l (+ 2 i)) (= l j)) (or (<= N (+ i 1)) (not (= l (+ 2 i))) (not (= j (+ 2 i)))) (or (<= N (+ i 1)) (= l 0) (< 0 l) (< (+ i 1) l) (< M (+ l 1))) (or (<= N (+ i 1)) (= l 0) (= l (+ 2 i)) (= M k)) (or (<= N (+ i 1)) (= l 0) (<= i 0) (< (+ i 1) l) (< M (+ l 1)))), 219169#(or (= (select A l) (select B l)) (< i N)), 219166#(or (= (select A l) (select B l)) (< k N))] [2022-03-15 22:18:36,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:36,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:18:36,067 INFO L87 Difference]: Start difference. First operand 1858 states and 8246 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:42,369 INFO L93 Difference]: Finished difference Result 2449 states and 9832 transitions. [2022-03-15 22:18:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:18:42,370 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:42,380 INFO L225 Difference]: With dead ends: 2449 [2022-03-15 22:18:42,380 INFO L226 Difference]: Without dead ends: 2415 [2022-03-15 22:18:42,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=868, Invalid=5452, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:18:42,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:42,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:18:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-03-15 22:18:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1859. [2022-03-15 22:18:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 4.441334768568353) internal successors, (8252), 1858 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 8252 transitions. [2022-03-15 22:18:42,410 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 8252 transitions. Word has length 17 [2022-03-15 22:18:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:42,410 INFO L470 AbstractCegarLoop]: Abstraction has 1859 states and 8252 transitions. [2022-03-15 22:18:42,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 8252 transitions. [2022-03-15 22:18:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:42,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:42,414 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:42,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-03-15 22:18:42,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:42,614 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 17064879, now seen corresponding path program 55 times [2022-03-15 22:18:42,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:42,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76022223] [2022-03-15 22:18:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:42,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:42,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76022223] [2022-03-15 22:18:42,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76022223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:42,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172588133] [2022-03-15 22:18:42,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:42,949 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:42,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 22:18:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:42,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:18:42,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:43,092 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 8 treesize of output 7 [2022-03-15 22:18:43,128 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:18:43,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:18:43,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:43,207 INFO L353 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-03-15 22:18:43,207 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:18:43,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:43,270 INFO L353 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2022-03-15 22:18:43,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:18:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:43,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:43,641 INFO L353 Elim1Store]: treesize reduction 20, result has 75.3 percent of original size [2022-03-15 22:18:43,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 27 treesize of output 78 [2022-03-15 22:18:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:43,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172588133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:43,867 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:43,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:18:43,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2096234503] [2022-03-15 22:18:43,867 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:43,868 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:43,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 52 transitions. [2022-03-15 22:18:43,870 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:44,413 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [225558#(and (or (<= N (+ i 1)) (= l 0) (< 0 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= M k)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (= (+ l (* (- 1) M)) 0))), 225553#(or (= (select A l) (select B l)) (< k N)), 225559#(and (or (<= N i) (= l 0) (< k N) (<= (+ j 1) M) (= l i) (< M (+ l 1))) (or (<= N i) (= l 0) (<= l M) (< k N) (<= (+ j 1) M) (= l i)) (or (= (select A l) (select B l)) (<= N i) (< j M) (< k N) (= l i))), 225556#(or (= (select A l) (select B l)) (< j M) (< k N)), 225554#(or (= (select A l) (select B l)) (<= N i) (= l i)), 225557#(and (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (<= N i) (= (+ l (* (- 1) M)) 0)) (or (<= N i) (<= 1 i)) (or (<= N i) (= M k)) (or (<= N i) (= l 0) (< 0 l) (< M (+ l 1)))), 225555#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i))] [2022-03-15 22:18:44,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:44,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:44,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:44,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:18:44,413 INFO L87 Difference]: Start difference. First operand 1859 states and 8252 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:47,014 INFO L93 Difference]: Finished difference Result 2432 states and 9963 transitions. [2022-03-15 22:18:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:18:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:47,020 INFO L225 Difference]: With dead ends: 2432 [2022-03-15 22:18:47,020 INFO L226 Difference]: Without dead ends: 2423 [2022-03-15 22:18:47,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=727, Invalid=3829, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:18:47,021 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:47,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2022-03-15 22:18:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1866. [2022-03-15 22:18:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 4.441286863270777) internal successors, (8283), 1865 states have internal predecessors, (8283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 8283 transitions. [2022-03-15 22:18:47,055 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 8283 transitions. Word has length 17 [2022-03-15 22:18:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:47,056 INFO L470 AbstractCegarLoop]: Abstraction has 1866 states and 8283 transitions. [2022-03-15 22:18:47,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 8283 transitions. [2022-03-15 22:18:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:47,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:47,059 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:47,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:47,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-15 22:18:47,260 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash 872371533, now seen corresponding path program 56 times [2022-03-15 22:18:47,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:47,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273050334] [2022-03-15 22:18:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:47,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:47,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273050334] [2022-03-15 22:18:47,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273050334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:47,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952733411] [2022-03-15 22:18:47,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:47,662 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 22:18:47,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:47,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:18:47,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:47,792 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 22:18:47,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:47,817 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 18 treesize of output 20 [2022-03-15 22:18:47,895 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:18:47,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:18:47,951 INFO L353 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2022-03-15 22:18:47,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:18:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:48,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:48,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:48,315 INFO L353 Elim1Store]: treesize reduction 15, result has 63.4 percent of original size [2022-03-15 22:18:48,315 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 27 treesize of output 45 [2022-03-15 22:18:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:48,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952733411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:48,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:48,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:18:48,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633988892] [2022-03-15 22:18:48,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:48,474 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:48,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 57 transitions. [2022-03-15 22:18:48,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:49,063 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [231916#(or (= (select A l) (select B l)) (< k N)), 231920#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 231922#(and (or (= (select A l) (select B l)) (= l 0) (< k N) (<= 2 M)) (or (= j 0) (< k N))), 231917#(or (= (select A l) (select B l)) (< j M) (< k N)), 231921#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 231919#(and (or (<= N (+ i 1)) (= l 0) (< 0 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= M k)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 0 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (= (+ l (* (- 1) M)) 0))), 231918#(and (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (<= N i) (= (+ l (* (- 1) M)) 0)) (or (<= N i) (<= 1 i)) (or (<= N i) (= M k)) (or (<= N i) (= l 0) (< 0 l) (< M (+ l 1))))] [2022-03-15 22:18:49,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:49,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:18:49,063 INFO L87 Difference]: Start difference. First operand 1866 states and 8283 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:53,100 INFO L93 Difference]: Finished difference Result 2334 states and 9700 transitions. [2022-03-15 22:18:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 22:18:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:53,105 INFO L225 Difference]: With dead ends: 2334 [2022-03-15 22:18:53,105 INFO L226 Difference]: Without dead ends: 2318 [2022-03-15 22:18:53,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1076, Invalid=6934, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 22:18:53,106 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:53,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-03-15 22:18:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1870. [2022-03-15 22:18:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 4.44836811128946) internal successors, (8314), 1869 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 8314 transitions. [2022-03-15 22:18:53,133 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 8314 transitions. Word has length 17 [2022-03-15 22:18:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:53,133 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 8314 transitions. [2022-03-15 22:18:53,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 8314 transitions. [2022-03-15 22:18:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:53,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:53,136 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:53,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-03-15 22:18:53,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 22:18:53,337 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -492329679, now seen corresponding path program 57 times [2022-03-15 22:18:53,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:53,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566939747] [2022-03-15 22:18:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:53,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:53,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566939747] [2022-03-15 22:18:53,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566939747] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:53,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230618440] [2022-03-15 22:18:53,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:53,680 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:53,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 22:18:53,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:18:53,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:53,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:18:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:53,801 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 22:18:53,833 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 14 treesize of output 16 [2022-03-15 22:18:53,870 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 16 treesize of output 18 [2022-03-15 22:18:53,919 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-03-15 22:18:53,920 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-03-15 22:18:54,161 INFO L353 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2022-03-15 22:18:54,162 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-03-15 22:18:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:54,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:54,604 INFO L353 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-03-15 22:18:54,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 66 [2022-03-15 22:18:54,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:54,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 894 treesize of output 886 [2022-03-15 22:18:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:55,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230618440] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:55,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:55,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 22:18:55,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323142033] [2022-03-15 22:18:55,401 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:55,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:55,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 78 transitions. [2022-03-15 22:18:55,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:56,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [238244#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (= l k) (= (+ j 1) l) (< (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)), 238234#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (= l i) (= (+ i 1) l)), 238243#(or (<= N (+ i 1)) (= (select A l) (select B l)) (= l k) (= (+ j 1) l) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (= l j) (= (+ i 1) l)), 238233#(or (= (select A l) (select B l)) (= l k) (not (< i N)) (<= (+ 2 i) N) (= l i)), 238237#(or (= (select A l) (select B l)) (< j M) (< i N)), 238242#(or (<= N (+ i 1)) (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (< (+ 2 i) N) (not (< j M)) (= l i) (= l j) (= (+ i 1) l)), 238239#(or (= (select A l) (select B l)) (= l k) (< j M) (< i N)), 238238#(or (= (select A l) (select B l)) (= l k) (< j M)), 238245#(and (or (= M l) (<= N i) (not (= l 0)) (not (= k j))) (or (= l k) (<= N i) (not (= M l))) (or (= M l) (<= N i) (= l 0) (< 0 l)) (or (<= (+ M 1) N) (<= N i)) (or (<= N i) (<= i 0)) (or (<= N i) (= j 0)) (or (<= (+ l i 1) N) (<= N i)) (or (<= N i) (= (+ i 1) M) (not (= (+ i 1) k)))), 238241#(or (<= N (+ i 1)) (= (select A l) (select B l)) (= l k) (< (+ 2 i) N) (< j M) (= l i) (= (+ i 1) l)), 238236#(or (= (select A l) (select B l)) (< i N)), 238240#(or (= (select A l) (select B l)) (= l k) (< (+ i 1) N) (< j M) (not (< i N)) (= l i)), 238235#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:18:56,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:18:56,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:18:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:18:56,400 INFO L87 Difference]: Start difference. First operand 1870 states and 8314 transitions. Second operand has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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 22:19:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:00,448 INFO L93 Difference]: Finished difference Result 3900 states and 15195 transitions. [2022-03-15 22:19:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 22:19:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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 17 [2022-03-15 22:19:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:00,456 INFO L225 Difference]: With dead ends: 3900 [2022-03-15 22:19:00,456 INFO L226 Difference]: Without dead ends: 3653 [2022-03-15 22:19:00,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2289 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1723, Invalid=7019, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:19:00,457 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 398 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:00,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 0 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:19:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2022-03-15 22:19:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 2014. [2022-03-15 22:19:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 2013 states have (on average 4.401390958768008) internal successors, (8860), 2013 states have internal predecessors, (8860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 8860 transitions. [2022-03-15 22:19:00,495 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 8860 transitions. Word has length 17 [2022-03-15 22:19:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:00,496 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 8860 transitions. [2022-03-15 22:19:00,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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 22:19:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 8860 transitions. [2022-03-15 22:19:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:00,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:00,499 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:00,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-03-15 22:19:00,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:00,700 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1553530889, now seen corresponding path program 58 times [2022-03-15 22:19:00,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:00,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901196499] [2022-03-15 22:19:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:01,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901196499] [2022-03-15 22:19:01,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901196499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:01,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101909809] [2022-03-15 22:19:01,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:19:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:01,012 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:01,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 22:19:01,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:19:01,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:01,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:19:01,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:01,129 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 22:19:01,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:01,161 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 18 treesize of output 20 [2022-03-15 22:19:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:01,204 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 22:19:01,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:01,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:01,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:01,297 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 29 treesize of output 34 [2022-03-15 22:19:01,355 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 23 treesize of output 28 [2022-03-15 22:19:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:01,576 INFO L353 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-03-15 22:19:01,576 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 3 case distinctions, treesize of input 22 treesize of output 31 [2022-03-15 22:19:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101909809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:01,671 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:01,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:19:01,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307137281] [2022-03-15 22:19:01,671 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:01,672 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:01,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:01,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:02,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [246402#(and (or (<= (+ 2 k) N) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) N) (not (< i N)) (= l i) (= (+ i 1) l))), 246403#(and (or (<= (+ 2 k) N) (< j M) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (not (< i N)) (= l i) (= (+ i 1) l))), 246404#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l))), 246397#(or (= (select A l) (select B l)) (< j M)), 246374#(or (and (= (select A l) (select B l)) (not (= l k))) (<= (+ 2 k) N) (< j M) (= l i)), 246399#(or (= (select A l) (select B l)) (< j M) (< k N)), 246400#(or (= (select A l) (select B l)) (< j M) (= l i)), 246398#(or (= (select A l) (select B l)) (< k N)), 246407#(and (or (= M l) (<= N i) (not (= l 0)) (not (= k j))) (or (<= N i) (<= l M) (= M k)) (or (= M l) (<= N i) (not (<= l M)) (= l 0) (< 0 l)) (or (<= N i) (<= i 0)) (or (<= (+ l 1) N) (<= N i) (<= l M)) (or (<= N i) (<= 0 i)) (or (<= N i) (= j 0)) (or (= M l) (<= N i) (= (+ i 1) M) (not (= (+ i 1) k)))), 246405#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (not (= l k)) (= (+ i 1) l))), 246401#(or (= (select A l) (select B l)) (< j M) (< k N) (= l i)), 246406#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (not (< (+ i 1) N)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (not (= l k))))] [2022-03-15 22:19:02,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:19:02,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:19:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:19:02,610 INFO L87 Difference]: Start difference. First operand 2014 states and 8860 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:06,555 INFO L93 Difference]: Finished difference Result 2930 states and 11535 transitions. [2022-03-15 22:19:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:19:06,556 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:06,561 INFO L225 Difference]: With dead ends: 2930 [2022-03-15 22:19:06,562 INFO L226 Difference]: Without dead ends: 2911 [2022-03-15 22:19:06,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=924, Invalid=5396, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:19:06,562 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:06,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:19:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2022-03-15 22:19:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2021. [2022-03-15 22:19:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2020 states have (on average 4.394554455445545) internal successors, (8877), 2020 states have internal predecessors, (8877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 8877 transitions. [2022-03-15 22:19:06,595 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 8877 transitions. Word has length 17 [2022-03-15 22:19:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:06,595 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 8877 transitions. [2022-03-15 22:19:06,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 8877 transitions. [2022-03-15 22:19:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:06,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:06,598 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:06,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:06,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:06,801 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash 434771727, now seen corresponding path program 59 times [2022-03-15 22:19:06,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:06,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845143173] [2022-03-15 22:19:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:07,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:07,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845143173] [2022-03-15 22:19:07,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845143173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:07,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959866610] [2022-03-15 22:19:07,065 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:19:07,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:07,066 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 22:19:07,119 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:19:07,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:07,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:19:07,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:07,193 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 8 treesize of output 7 [2022-03-15 22:19:07,217 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 14 treesize of output 16 [2022-03-15 22:19:07,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:07,287 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 14 treesize of output 16 [2022-03-15 22:19:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:07,331 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 20 treesize of output 22 [2022-03-15 22:19:07,352 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 23 treesize of output 28 [2022-03-15 22:19:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:07,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:07,566 INFO L353 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-03-15 22:19:07,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 59 [2022-03-15 22:19:07,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:07,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:07,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-03-15 22:19:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:07,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959866610] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:07,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:07,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:19:07,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630627051] [2022-03-15 22:19:07,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:07,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:07,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:07,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:08,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [253597#(or (= (select A l) (select B l)) (< j M) (< k N)), 253606#(and (or (= M l) (<= N i) (not (= l 0)) (not (= k j))) (or (= M l) (<= N i) (= l 0) (< 0 l)) (or (<= (+ M 1) N) (<= N i)) (or (<= N i) (<= i 0)) (or (<= N i) (= j 0)) (or (<= (+ l i 1) N) (<= N i))), 253601#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 253598#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 253600#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 253602#(and (or (< (+ 2 i) N) (< j M) (= l 0) (= (+ (- 1) N) l) (= l i)) (or (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (not (= l k)) (= l i)) (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (= l i))), 253603#(and (or (< (+ j 1) M) (< (+ 2 i) N) (= l 0) (not (< j M)) (= l i) (= (+ l 1) N)) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (not (= l k)) (= l i) (= (+ l 1) N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= l i) (= (+ l 1) N) (= l j))), 253593#(or (= (select A l) (select B l)) (< j M) (< i N)), 253595#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 253599#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 253594#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 253592#(or (= (select A l) (select B l)) (< j M)), 253604#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (< (+ 2 i) N) (< (+ 2 j) M) (= l i) (= (+ l 1) N) (= l j)) (or (not (< (+ j 1) M)) (< (+ 2 i) N) (= l 0) (< (+ 2 j) M) (= l i) (= (+ l 1) N)) (or (not (< (+ j 1) M)) (< (+ 2 i) N) (< (+ 2 j) M) (not (= l k)) (= l i) (= (+ l 1) N))), 253605#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= l i) (= (+ l 1) N) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (= l 0) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= (+ l 1) N) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (not (< i N)) (< (+ 2 j) M))), 253596#(or (= (select A l) (select B l)) (< k N))] [2022-03-15 22:19:08,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:19:08,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:19:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:19:08,983 INFO L87 Difference]: Start difference. First operand 2021 states and 8877 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:13,983 INFO L93 Difference]: Finished difference Result 3373 states and 12725 transitions. [2022-03-15 22:19:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 22:19:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:13,991 INFO L225 Difference]: With dead ends: 3373 [2022-03-15 22:19:13,991 INFO L226 Difference]: Without dead ends: 3301 [2022-03-15 22:19:13,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1440, Invalid=7302, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:19:13,991 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 365 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:13,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 0 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:19:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-03-15 22:19:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2040. [2022-03-15 22:19:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2039 states have (on average 4.394310936733693) internal successors, (8960), 2039 states have internal predecessors, (8960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 8960 transitions. [2022-03-15 22:19:14,029 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 8960 transitions. Word has length 17 [2022-03-15 22:19:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:14,029 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 8960 transitions. [2022-03-15 22:19:14,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 8960 transitions. [2022-03-15 22:19:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:14,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:14,041 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:14,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:14,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:14,248 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash 372503189, now seen corresponding path program 60 times [2022-03-15 22:19:14,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:14,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036666730] [2022-03-15 22:19:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:14,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:14,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036666730] [2022-03-15 22:19:14,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036666730] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:14,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956483180] [2022-03-15 22:19:14,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:19:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:14,631 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:14,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 22:19:14,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:19:14,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:14,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:19:14,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:14,747 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 22:19:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:14,785 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 20 treesize of output 22 [2022-03-15 22:19:14,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:14,815 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 22:19:14,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:14,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:14,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:14,912 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 29 treesize of output 34 [2022-03-15 22:19:14,969 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 23 treesize of output 28 [2022-03-15 22:19:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:15,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:15,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:15,181 INFO L353 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-03-15 22:19:15,181 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 2 case distinctions, treesize of input 24 treesize of output 30 [2022-03-15 22:19:15,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:15,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 22:19:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:15,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956483180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:15,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:15,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:19:15,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [158489532] [2022-03-15 22:19:15,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:15,322 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:15,324 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 22:19:15,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:16,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [261289#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (<= (+ 2 k) N) (not (< i N)) (< (+ 2 j) M) (not (= l k)) (= (+ i 1) l))), 261290#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (not (< (+ i 1) N)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (<= (+ 2 k) N) (< (+ 2 j) M) (= l (+ 2 i)) (not (= l k)))), 261260#(or (and (= (select A l) (select B l)) (not (= l k))) (<= (+ 2 k) N) (< j M) (= l i)), 261284#(or (= (select A l) (select B l)) (< k N)), 261264#(or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (= l i) (and (= (select A l) (select (store B j (select A j)) l)) (not (= l k)))), 261291#(and (or (= M l) (<= N i) (= M k) (not (= (+ i 1) l))) (or (<= N i) (<= l M) (= M k)) (or (<= N i) (<= i 0)) (or (<= (+ l 1) N) (<= N i) (<= l M)) (or (<= N i) (<= 0 i)) (or (<= N i) (= j 0)) (or (= M l) (<= N i) (not (<= l M)) (= l 0) (not (<= l (+ i 1))) (= (+ i 1) l)) (or (= M l) (<= N i) (not (<= l (+ i 1))) (= (+ i 1) l) (not (= k j)))), 261287#(or (= (select A l) (select B l)) (< j M) (< k N) (= l i)), 261288#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< i N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l))), 261285#(or (= (select A l) (select B l)) (< j M) (< k N)), 261283#(or (= (select A l) (select B l)) (< j M)), 261286#(or (= (select A l) (select B l)) (< j M) (= l i))] [2022-03-15 22:19:16,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:19:16,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:19:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:19:16,132 INFO L87 Difference]: Start difference. First operand 2040 states and 8960 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:20,157 INFO L93 Difference]: Finished difference Result 2751 states and 11057 transitions. [2022-03-15 22:19:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:19:20,157 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:20,162 INFO L225 Difference]: With dead ends: 2751 [2022-03-15 22:19:20,162 INFO L226 Difference]: Without dead ends: 2727 [2022-03-15 22:19:20,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=750, Invalid=4080, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:19:20,163 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:20,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2022-03-15 22:19:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2041. [2022-03-15 22:19:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2040 states have (on average 4.394607843137255) internal successors, (8965), 2040 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 8965 transitions. [2022-03-15 22:19:20,195 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 8965 transitions. Word has length 17 [2022-03-15 22:19:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:20,195 INFO L470 AbstractCegarLoop]: Abstraction has 2041 states and 8965 transitions. [2022-03-15 22:19:20,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 8965 transitions. [2022-03-15 22:19:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:20,199 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:20,199 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:20,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:20,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:20,400 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -434003317, now seen corresponding path program 61 times [2022-03-15 22:19:20,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:20,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446860688] [2022-03-15 22:19:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:20,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:20,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446860688] [2022-03-15 22:19:20,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446860688] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:20,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281959968] [2022-03-15 22:19:20,717 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:20,720 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:20,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 22:19:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:20,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:19:20,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:20,850 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 22:19:20,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:20,887 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 20 treesize of output 22 [2022-03-15 22:19:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:20,958 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 22:19:20,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:20,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:20,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:20,994 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 29 treesize of output 34 [2022-03-15 22:19:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:21,067 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 27 treesize of output 32 [2022-03-15 22:19:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:21,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:21,330 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:19:21,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 69 [2022-03-15 22:19:21,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:21,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:21,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 882 treesize of output 866 [2022-03-15 22:19:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:22,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281959968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:22,418 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:22,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:19:22,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2016307202] [2022-03-15 22:19:22,418 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:22,419 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:22,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:22,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:23,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [268328#(and (or (<= (+ l 1) N) (= l 0) (not (< i N))) (or (= l k) (= l 0) (not (<= l 0)) (not (< i N))) (or (= l k) (= l 0) (not (< i N)) (<= (+ k 1) l)) (or (= (select A l) (select B l)) (<= (+ k 1) i) (not (< i N)) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (<= k i) (not (< i N)))), 268324#(or (= (select A l) (select B l)) (< j M) (< k N)), 268326#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (<= (+ l 1) N) (= (select A l) (select B l)) (= l k) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 268329#(and (or (= l k) (< j M) (= l 0) (not (< i N)) (<= (+ k 1) l)) (or (= l k) (< j M) (= l 0) (not (<= l 0)) (not (< i N))) (or (= (select A l) (select B l)) (< j M) (<= (+ k 1) i) (not (< i N)) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (<= (+ l 1) N) (< j M) (= l 0) (not (< i N))) (or (<= k i) (< j M) (not (< i N)))), 268327#(and (or (<= (+ l 1) N) (= l k) (< j M) (= l 0)) (or (= l k) (< j M) (= l 0) (<= (+ k 1) l)) (or (= l k) (< j M) (= l 0) (not (<= l 0))) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i))), 268331#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (not (< j M)) (<= k (+ i 1))) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (<= l 0)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< (+ i 1) N)) (<= k i) (not (< j M)) (not (= l 0)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (< j M)) (<= (+ k 1) l)) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< (+ i 1) N)) (= l 0) (not (< j M)))), 268323#(or (= (select A l) (select B l)) (< k N)), 268330#(and (or (< (+ j 1) M) (= l k) (= l 0) (not (<= l 0)) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ k 1) i) (not (< i N)) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ l 1) N) (< (+ j 1) M) (= l 0) (not (< i N)) (not (< j M))) (or (< (+ j 1) M) (<= k i) (not (< i N)) (not (< j M))) (or (< (+ j 1) M) (= l k) (= l 0) (not (< i N)) (not (< j M)) (<= (+ k 1) l))), 268321#(or (= (select A l) (select B l)) (< j M)), 268322#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 268332#(and (or (= M l) (<= N i) (= l 0) (not (<= l 0))) (or (<= N i) (<= 0 i)) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (= M l) (<= N i) (<= (+ l 1) M)) (or (<= N i) (= M k))), 268325#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (< 0 l) (= l i)))] [2022-03-15 22:19:23,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:19:23,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:23,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:19:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:19:23,744 INFO L87 Difference]: Start difference. First operand 2041 states and 8965 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:28,590 INFO L93 Difference]: Finished difference Result 2867 states and 11476 transitions. [2022-03-15 22:19:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 22:19:28,590 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:28,596 INFO L225 Difference]: With dead ends: 2867 [2022-03-15 22:19:28,596 INFO L226 Difference]: Without dead ends: 2850 [2022-03-15 22:19:28,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1474, Invalid=7268, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:19:28,597 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:28,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2022-03-15 22:19:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2040. [2022-03-15 22:19:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2039 states have (on average 4.393820500245218) internal successors, (8959), 2039 states have internal predecessors, (8959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 8959 transitions. [2022-03-15 22:19:28,628 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 8959 transitions. Word has length 17 [2022-03-15 22:19:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:28,628 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 8959 transitions. [2022-03-15 22:19:28,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 8959 transitions. [2022-03-15 22:19:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:28,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:28,640 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:28,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:28,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:28,840 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash -242321669, now seen corresponding path program 62 times [2022-03-15 22:19:28,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:28,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131422623] [2022-03-15 22:19:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:29,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:29,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131422623] [2022-03-15 22:19:29,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131422623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:29,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242529607] [2022-03-15 22:19:29,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:29,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:29,089 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:29,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 22:19:29,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:29,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:29,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:29,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:29,232 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 8 treesize of output 7 [2022-03-15 22:19:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:29,301 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 14 treesize of output 16 [2022-03-15 22:19:29,326 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 16 treesize of output 18 [2022-03-15 22:19:29,365 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:19:29,366 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:19:29,444 INFO L353 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2022-03-15 22:19:29,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 33 [2022-03-15 22:19:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:29,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:29,718 INFO L353 Elim1Store]: treesize reduction 25, result has 71.9 percent of original size [2022-03-15 22:19:29,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 86 [2022-03-15 22:19:29,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:29,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:29,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:29,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 22:19:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:29,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242529607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:29,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:29,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:19:29,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37832464] [2022-03-15 22:19:29,951 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:29,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:29,955 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 22:19:29,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:30,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [275519#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 275515#(or (= (select A l) (select B l)) (< j M) (< k N)), 275523#(and (or (< (+ j 1) M) (<= (+ i 1) k) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ k 1) l) (= (+ i 1) l))), 275518#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 275524#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< i M) (<= N i) (<= i 0)) (or (<= N i) (= j 0)) (or (<= (+ l i 1) N) (= M l) (<= N i) (not (= (+ i 1) M))) (or (<= N i) (not (= (+ i 1) M)) (<= i 0)) (or (<= N i) (= l 0) (not (= (+ i 1) M)) (< M (+ l 1)))), 275514#(or (= (select A l) (select B l)) (< k N)), 275521#(and (or (= (select A l) (select B l)) (<= (+ i 1) k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= i k)) (or (<= (+ i 1) k) (< j M) (= l 0) (<= (+ l i 1) (+ N k)) (= l i)) (or (<= (+ i 1) k) (< j M) (= l 0) (= l i) (<= (+ k 1) l))), 275520#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 275513#(or (= (select A l) (select B l)) (< j M) (< i N)), 275517#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 275522#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (not (= l 0)) (= l i) (= l j)) (or (< (+ j 1) M) (<= (+ i 1) k) (= l 0) (not (< j M)) (= l i) (<= (+ k 1) l)) (or (< (+ j 1) M) (not (< j M)) (<= i k)) (or (< (+ j 1) M) (<= (+ i 1) k) (= l 0) (not (< j M)) (<= (+ l i 1) (+ N k)) (= l i))), 275516#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 275512#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:19:30,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:19:30,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:19:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:19:30,978 INFO L87 Difference]: Start difference. First operand 2040 states and 8959 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:36,030 INFO L93 Difference]: Finished difference Result 3780 states and 14664 transitions. [2022-03-15 22:19:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 22:19:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:36,038 INFO L225 Difference]: With dead ends: 3780 [2022-03-15 22:19:36,038 INFO L226 Difference]: Without dead ends: 3709 [2022-03-15 22:19:36,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1676, Invalid=8424, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 22:19:36,039 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:36,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-03-15 22:19:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 2267. [2022-03-15 22:19:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 2266 states have (on average 4.421888790820829) internal successors, (10020), 2266 states have internal predecessors, (10020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 10020 transitions. [2022-03-15 22:19:36,103 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 10020 transitions. Word has length 17 [2022-03-15 22:19:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:36,104 INFO L470 AbstractCegarLoop]: Abstraction has 2267 states and 10020 transitions. [2022-03-15 22:19:36,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 10020 transitions. [2022-03-15 22:19:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:36,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:36,108 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:36,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-03-15 22:19:36,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-03-15 22:19:36,319 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1202873817, now seen corresponding path program 63 times [2022-03-15 22:19:36,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:36,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392596035] [2022-03-15 22:19:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:36,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:36,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392596035] [2022-03-15 22:19:36,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392596035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:36,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058324952] [2022-03-15 22:19:36,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:36,576 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:36,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 22:19:36,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:19:36,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:36,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:19:36,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:36,692 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 8 treesize of output 7 [2022-03-15 22:19:36,757 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:19:36,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:19:36,810 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-03-15 22:19:36,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:19:36,933 INFO L353 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-03-15 22:19:36,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:19:37,019 INFO L353 Elim1Store]: treesize reduction 104, result has 16.8 percent of original size [2022-03-15 22:19:37,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 48 [2022-03-15 22:19:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:37,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:37,638 INFO L353 Elim1Store]: treesize reduction 25, result has 79.3 percent of original size [2022-03-15 22:19:37,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 32 treesize of output 116 [2022-03-15 22:19:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:37,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058324952] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:37,816 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:37,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 22:19:37,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [809033622] [2022-03-15 22:19:37,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:37,817 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:37,819 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:37,820 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:39,041 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [284090#(or (= (select A l) (select B l)) (< j M) (< k N)), 284087#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 284085#(or (= (select A l) (select B l)) (< j M) (< i N)), 284098#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< i M) (<= N i) (<= i 0)) (or (<= N i) (= j 0)) (or (<= (+ l i 1) N) (= M l) (<= N i) (not (= (+ i 1) M))) (or (<= N i) (not (= (+ i 1) M)) (<= i 0)) (or (<= N i) (= l 0) (not (= (+ i 1) M)) (< M (+ l 1)))), 284093#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 284086#(or (= (select A l) (select B l)) (< k N)), 284084#(or (= (select A l) (select B l)) (< j M)), 284094#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 284096#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (not (= l 0)) (= l i) (= l j)) (or (< (+ j 1) M) (<= (+ i 1) k) (= l 0) (not (< j M)) (= l i) (<= (+ k 1) l)) (or (< (+ j 1) M) (not (< j M)) (<= i k)) (or (< (+ j 1) M) (<= (+ i 1) k) (= l 0) (not (< j M)) (<= (+ l i 1) (+ N k)) (= l i))), 284089#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 284091#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 284092#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 284095#(and (or (= (select A l) (select B l)) (<= (+ i 1) k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= i k)) (or (<= (+ i 1) k) (< j M) (= l 0) (<= (+ l i 1) (+ N k)) (= l i)) (or (<= (+ i 1) k) (< j M) (= l 0) (= l i) (<= (+ k 1) l))), 284088#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 284097#(and (or (< (+ j 1) M) (<= (+ i 1) k) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ k 1) l) (= (+ i 1) l)))] [2022-03-15 22:19:39,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:19:39,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:39,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:19:39,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1577, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:19:39,042 INFO L87 Difference]: Start difference. First operand 2267 states and 10020 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:43,692 INFO L93 Difference]: Finished difference Result 3743 states and 14765 transitions. [2022-03-15 22:19:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:19:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:43,700 INFO L225 Difference]: With dead ends: 3743 [2022-03-15 22:19:43,700 INFO L226 Difference]: Without dead ends: 3686 [2022-03-15 22:19:43,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1649, Invalid=8053, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:19:43,700 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:43,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-03-15 22:19:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 2318. [2022-03-15 22:19:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 4.425118687958567) internal successors, (10253), 2317 states have internal predecessors, (10253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 10253 transitions. [2022-03-15 22:19:43,742 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 10253 transitions. Word has length 17 [2022-03-15 22:19:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:43,742 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 10253 transitions. [2022-03-15 22:19:43,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 10253 transitions. [2022-03-15 22:19:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:43,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:43,746 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:43,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:43,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:43,947 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:43,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1558776839, now seen corresponding path program 21 times [2022-03-15 22:19:43,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:43,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915399361] [2022-03-15 22:19:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:44,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:44,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915399361] [2022-03-15 22:19:44,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915399361] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:44,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43408140] [2022-03-15 22:19:44,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:44,210 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:44,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 22:19:44,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:19:44,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:44,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:19:44,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:44,379 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 22:19:44,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:44,405 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 18 treesize of output 20 [2022-03-15 22:19:44,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:44,433 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 20 treesize of output 22 [2022-03-15 22:19:44,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:44,481 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 22:19:44,481 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2022-03-15 22:19:44,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:44,674 INFO L353 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2022-03-15 22:19:44,675 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 61 [2022-03-15 22:19:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:45,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:45,618 INFO L353 Elim1Store]: treesize reduction 15, result has 72.7 percent of original size [2022-03-15 22:19:45,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 62 [2022-03-15 22:19:45,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:45,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 1742 treesize of output 1726 [2022-03-15 22:19:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:48,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43408140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:48,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:48,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 22:19:48,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615797727] [2022-03-15 22:19:48,170 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:48,171 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:48,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:48,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:49,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [292725#(and (or (<= N i) (not (= M 0)) (= M k)) (or (<= N i) (= l 0) (not (= M 0)) (< i l)) (or (<= N i) (= M 0) (= j 0)) (or (<= (+ l 1) N) (<= N i) (not (= M 0)) (= (+ i 1) l)) (or (<= N i) (<= 0 i) (not (= M 0))) (or (<= N i) (= M 0) (not (<= M 0)))), 292720#(and (or (<= (+ l 1) N) (<= (+ 2 k) i) (= l k) (< j M) (= l 0)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (not (<= l 0))) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (<= (+ k 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i))), 292723#(and (or (= l k) (<= N i) (not (= l 0)) (= (+ i 1) l)) (or (<= N i) (<= k i)) (or (<= N i) (= l 0) (not (<= l 0)) (= (+ i 1) l)) (or (<= N i) (= l 0) (< i l)) (or (<= (+ l 1) N) (<= N i) (= (+ i 1) l))), 292718#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (< 0 l) (= l i))), 292722#(and (or (< j M) (= l 0) (< i (+ l 1))) (or (= l k) (< j M) (not (= l 0)) (= l i)) (or (<= (+ l 1) N) (< j M) (= l 0) (= l i)) (or (< j M) (= l 0) (not (<= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i))), 292714#(or (= (select A l) (select B l)) (< j M)), 292724#(and (or (<= N i) (< j M) (= l 0) (< i l)) (or (<= N i) (< j M) (= l 0) (not (<= l 0)) (= (+ i 1) l)) (or (<= N i) (<= k i) (< j M)) (or (= l k) (<= N i) (< j M) (not (= l 0)) (= (+ i 1) l)) (or (<= (+ l 1) N) (<= N i) (< j M) (= (+ i 1) l))), 292716#(or (= (select A l) (select B l)) (< k N)), 292721#(and (or (< j M) (not (= k i)) (= l 0) (< i (+ l 1))) (or (= (select A l) (select B l)) (< j M) (not (= k i)) (not (= l 0)) (= l i)) (or (< j M) (not (= k i)) (= l 0) (not (<= l 0)) (= l i)) (or (<= k i) (< j M)) (or (<= (+ l 1) N) (< j M) (not (= k i)) (= l 0) (= l i))), 292717#(or (= (select A l) (select B l)) (< j M) (< k N)), 292719#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (<= (+ l 1) N) (= (select A l) (select B l)) (= l k) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 292715#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i))] [2022-03-15 22:19:49,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:19:49,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:49,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:19:49,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:19:49,257 INFO L87 Difference]: Start difference. First operand 2318 states and 10253 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:54,000 INFO L93 Difference]: Finished difference Result 2830 states and 11804 transitions. [2022-03-15 22:19:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:19:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:54,006 INFO L225 Difference]: With dead ends: 2830 [2022-03-15 22:19:54,006 INFO L226 Difference]: Without dead ends: 2820 [2022-03-15 22:19:54,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1076, Invalid=6234, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 22:19:54,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:54,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-03-15 22:19:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2320. [2022-03-15 22:19:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 4.424752048296679) internal successors, (10261), 2319 states have internal predecessors, (10261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 10261 transitions. [2022-03-15 22:19:54,043 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 10261 transitions. Word has length 17 [2022-03-15 22:19:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:54,043 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 10261 transitions. [2022-03-15 22:19:54,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 10261 transitions. [2022-03-15 22:19:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:54,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:54,047 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:54,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-03-15 22:19:54,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:54,247 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2094006641, now seen corresponding path program 22 times [2022-03-15 22:19:54,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:54,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347462134] [2022-03-15 22:19:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:54,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:54,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347462134] [2022-03-15 22:19:54,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347462134] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:54,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67150401] [2022-03-15 22:19:54,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:19:54,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:54,489 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:54,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 22:19:54,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:19:54,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:54,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:54,648 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 22:19:54,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,673 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 22:19:54,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:54,721 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 22:19:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,755 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 29 treesize of output 34 [2022-03-15 22:19:54,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:54,828 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 31 treesize of output 36 [2022-03-15 22:19:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:54,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:55,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:55,148 INFO L353 Elim1Store]: treesize reduction 29, result has 66.7 percent of original size [2022-03-15 22:19:55,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 84 [2022-03-15 22:19:55,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:55,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:55,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:55,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2022-03-15 22:19:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:55,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67150401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:55,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:55,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:19:55,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765351430] [2022-03-15 22:19:55,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:55,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:55,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 22:19:55,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:56,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [300417#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= l k) (< j M) (not (= k i)) (= l 0) (not (<= l 0))) (or (< j M) (<= i k)) (or (< k (+ l 1)) (< j M) (not (= k i)) (= l 0)) (or (= l k) (< j M) (not (= k i)) (= l 0) (<= (+ l i 1) (+ N k)))), 300413#(or (= (select A l) (select B l)) (< j M) (< k N)), 300418#(and (or (< j M) (<= k 0)) (or (< j M) (<= i (+ k 1))) (or (= l k) (< j M) (not (= l 0))) (or (< j M) (= l 0) (not (<= l 0))) (or (< j M) (= l 0) (<= (+ l i) (+ N k)))), 300419#(and (or (<= N i) (= l 0) (not (<= l 0))) (or (= l k) (<= N i) (not (= l 0))) (or (<= N i) (<= (+ l i 1) (+ N k))) (or (<= N i) (<= k 0)) (or (<= N i) (<= i k))), 300411#(or (= (select A l) (select B l)) (< k N)), 300409#(or (= (select A l) (select B l)) (< j M) (< i N)), 300420#(and (or (<= N i) (< j M) (<= (+ l i 1) (+ N k))) (or (<= N i) (< j M) (<= i k)) (or (<= N i) (< j M) (= l 0) (not (<= l 0))) (or (<= N i) (< j M) (<= k 0)) (or (= l k) (<= N i) (< j M) (not (= l 0)))), 300415#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 300421#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (= l 0) (not (<= l 0)) (not (= M 0))) (or (= (+ (* (- 1) k) M) 0) (<= N i) (not (= M 0))) (or (<= (+ l i 1) (+ N M)) (<= N i) (not (= M 0))) (or (<= N i) (<= i M) (not (= M 0))) (or (<= N i) (= M 0) (not (<= M 0)))), 300412#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 300408#(or (= (select A l) (select B l)) (< j M)), 300414#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 300410#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 300416#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (< 0 l) (= l i)))] [2022-03-15 22:19:56,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:19:56,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:19:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:19:56,400 INFO L87 Difference]: Start difference. First operand 2320 states and 10261 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:59,265 INFO L93 Difference]: Finished difference Result 3175 states and 13122 transitions. [2022-03-15 22:19:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:19:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:19:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:59,272 INFO L225 Difference]: With dead ends: 3175 [2022-03-15 22:19:59,272 INFO L226 Difference]: Without dead ends: 3106 [2022-03-15 22:19:59,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1025, Invalid=5295, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:19:59,273 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:59,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-03-15 22:19:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2334. [2022-03-15 22:19:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2333 states have (on average 4.425203600514359) internal successors, (10324), 2333 states have internal predecessors, (10324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 10324 transitions. [2022-03-15 22:19:59,310 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 10324 transitions. Word has length 17 [2022-03-15 22:19:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:59,310 INFO L470 AbstractCegarLoop]: Abstraction has 2334 states and 10324 transitions. [2022-03-15 22:19:59,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 10324 transitions. [2022-03-15 22:19:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:59,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:59,314 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:59,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:59,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:59,515 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -755765169, now seen corresponding path program 23 times [2022-03-15 22:19:59,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:59,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097503144] [2022-03-15 22:19:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:59,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:59,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097503144] [2022-03-15 22:19:59,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097503144] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:59,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089824032] [2022-03-15 22:19:59,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:19:59,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:59,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:59,778 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:59,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 22:19:59,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:19:59,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:59,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:19:59,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:59,938 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 22:19:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:59,963 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 20 treesize of output 22 [2022-03-15 22:19:59,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:59,994 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 18 treesize of output 20 [2022-03-15 22:20:00,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:00,058 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 22:20:00,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:00,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:00,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:00,094 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 31 treesize of output 36 [2022-03-15 22:20:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:00,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:00,388 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:20:00,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 56 [2022-03-15 22:20:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:00,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089824032] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:00,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:00,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:00,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563671681] [2022-03-15 22:20:00,496 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:00,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:00,500 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2022-03-15 22:20:00,500 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:01,643 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [308471#(or (= (select A l) (select B l)) (< j M) (< k N)), 308473#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 308480#(and (or (<= N i) (= M 0) (= j 0)) (or (<= N i) (= l 0) (not (<= l 0)) (not (= M 0))) (or (= (+ (* (- 1) k) M) 0) (<= N i) (not (= M 0))) (or (<= (+ l i 1) (+ N M)) (<= N i) (not (= M 0))) (or (<= N i) (<= i M) (not (= M 0))) (or (<= N i) (= M 0) (not (<= M 0)))), 308468#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 308476#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= l k) (< j M) (not (= k i)) (= l 0) (not (<= l 0))) (or (< j M) (<= i k)) (or (< k (+ l 1)) (< j M) (not (= k i)) (= l 0)) (or (= l k) (< j M) (not (= k i)) (= l 0) (<= (+ l i 1) (+ N k)))), 308465#(or (= (select A l) (select B l)) (< j M)), 308472#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 308474#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 308470#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 308477#(and (or (< j M) (<= k 0)) (or (< j M) (<= i (+ k 1))) (or (= l k) (< j M) (not (= l 0))) (or (< j M) (= l 0) (not (<= l 0))) (or (< j M) (= l 0) (<= (+ l i) (+ N k)))), 308478#(and (or (<= N i) (= l 0) (not (<= l 0))) (or (= l k) (<= N i) (not (= l 0))) (or (<= N i) (<= (+ l i 1) (+ N k))) (or (<= N i) (<= k 0)) (or (<= N i) (<= i k))), 308469#(or (= (select A l) (select B l)) (< k N)), 308467#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 308479#(and (or (<= N i) (< j M) (<= (+ l i 1) (+ N k))) (or (<= N i) (< j M) (<= i k)) (or (<= N i) (< j M) (= l 0) (not (<= l 0))) (or (<= N i) (< j M) (<= k 0)) (or (= l k) (<= N i) (< j M) (not (= l 0)))), 308475#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (< 0 l) (= l i))), 308466#(or (= (select A l) (select B l)) (< j M) (< i N))] [2022-03-15 22:20:01,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:20:01,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:20:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:20:01,643 INFO L87 Difference]: Start difference. First operand 2334 states and 10324 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:03,602 INFO L93 Difference]: Finished difference Result 2986 states and 12501 transitions. [2022-03-15 22:20:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:20:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:03,609 INFO L225 Difference]: With dead ends: 2986 [2022-03-15 22:20:03,609 INFO L226 Difference]: Without dead ends: 2979 [2022-03-15 22:20:03,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=875, Invalid=4675, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 22:20:03,610 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:03,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2022-03-15 22:20:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2335. [2022-03-15 22:20:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 4.4245929734361615) internal successors, (10327), 2334 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 10327 transitions. [2022-03-15 22:20:03,648 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 10327 transitions. Word has length 17 [2022-03-15 22:20:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:03,648 INFO L470 AbstractCegarLoop]: Abstraction has 2335 states and 10327 transitions. [2022-03-15 22:20:03,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 10327 transitions. [2022-03-15 22:20:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:03,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:03,652 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:03,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:03,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:03,852 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:03,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1149100215, now seen corresponding path program 64 times [2022-03-15 22:20:03,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:03,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863659952] [2022-03-15 22:20:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:03,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:04,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:04,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863659952] [2022-03-15 22:20:04,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863659952] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:04,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412871451] [2022-03-15 22:20:04,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:04,144 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:04,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 22:20:04,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:04,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:04,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:20:04,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:04,323 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 22:20:04,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:04,349 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 18 treesize of output 20 [2022-03-15 22:20:04,379 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 16 treesize of output 18 [2022-03-15 22:20:04,407 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 23 treesize of output 28 [2022-03-15 22:20:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:04,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:04,614 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:20:04,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 51 [2022-03-15 22:20:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:04,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412871451] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:04,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:04,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:04,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069693452] [2022-03-15 22:20:04,768 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:04,769 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:04,771 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 57 transitions. [2022-03-15 22:20:04,771 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:05,621 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [316333#(and (or (<= (+ l 1) N) (<= N i) (= l 0)) (or (= M l) (<= N i) (= l 0) (< 0 l)) (or (<= (+ M 1) N) (<= N i)) (or (<= N i) (= l 0) (<= l M) (= M k)) (or (= M l) (<= N i) (= j 0)) (or (<= N i) (<= i j))), 316325#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i)), 316323#(or (= (select A l) (select B l)) (< k N)), 316326#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 316328#(and (or (= (select A l) (select B l)) (= M l) (< k N) (<= (+ 2 i) N)) (or (< i (+ M 1)) (< k N)) (or (<= (+ M 1) N) (< k N) (<= M i))), 316332#(and (or (= l 0) (<= l M) (not (= j i)) (< k N) (= l j)) (or (= M l) (= l 0) (not (= j i)) (< k N) (not (<= l j)) (= l j)) (or (= (select A l) (select B l)) (= M l) (not (= j i)) (< k N) (not (= l 0)) (= l j)) (or (< k N) (<= i j)) (or (<= (+ M 1) N) (< k N))), 316331#(and (or (<= (+ 3 i) N) (= M l) (= l 0) (< k N) (= l i)) (or (< k N) (<= (+ i 1) M)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (= M l) (< k N) (= l i)) (or (<= (+ M 1) N) (< k N))), 316329#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l i) (= (+ i 1) l)), 316285#(or (= (select A l) (select B l)) (< j M)), 316330#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)), 316324#(or (= (select A l) (select B l)) (< j M) (< k N)), 316327#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i))] [2022-03-15 22:20:05,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:20:05,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:05,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:20:05,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:20:05,622 INFO L87 Difference]: Start difference. First operand 2335 states and 10327 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:07,672 INFO L93 Difference]: Finished difference Result 3181 states and 13296 transitions. [2022-03-15 22:20:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 22:20:07,673 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:07,679 INFO L225 Difference]: With dead ends: 3181 [2022-03-15 22:20:07,679 INFO L226 Difference]: Without dead ends: 3115 [2022-03-15 22:20:07,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=683, Invalid=3873, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:20:07,679 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:07,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:20:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2022-03-15 22:20:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2321. [2022-03-15 22:20:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2320 states have (on average 4.396982758620689) internal successors, (10201), 2320 states have internal predecessors, (10201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 10201 transitions. [2022-03-15 22:20:07,714 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 10201 transitions. Word has length 17 [2022-03-15 22:20:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:07,714 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 10201 transitions. [2022-03-15 22:20:07,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 10201 transitions. [2022-03-15 22:20:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:07,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:07,718 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:07,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:07,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:07,919 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2023536661, now seen corresponding path program 65 times [2022-03-15 22:20:07,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:07,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237715837] [2022-03-15 22:20:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:08,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:08,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237715837] [2022-03-15 22:20:08,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237715837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:08,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500053313] [2022-03-15 22:20:08,265 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:20:08,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:08,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:08,266 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:08,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 22:20:08,323 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:20:08,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:08,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:20:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:08,412 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 8 treesize of output 7 [2022-03-15 22:20:08,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:08,442 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 20 treesize of output 22 [2022-03-15 22:20:08,480 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 21 treesize of output 26 [2022-03-15 22:20:08,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:08,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:08,596 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 23 treesize of output 28 [2022-03-15 22:20:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:08,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:08,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:08,771 INFO L353 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2022-03-15 22:20:08,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 22:20:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:08,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500053313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:08,886 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:08,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 22:20:08,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947737267] [2022-03-15 22:20:08,886 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:08,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:08,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 81 transitions. [2022-03-15 22:20:08,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:09,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [324346#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l k) (< j M) (= l (+ 2 i)) (= l i) (= (+ i 1) l)), 324345#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l k) (= l (+ 2 i)) (= l i) (= (+ i 1) l)), 324337#(or (= (select A l) (select B l)) (= l k) (not (< i N)) (<= (+ 2 i) N) (= l i)), 324341#(or (= (select A l) (select B l)) (< j M) (< i N)), 324339#(or (= (select A l) (select B l)) (< j M)), 324348#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (<= M (+ j 1)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)), 324340#(or (= (select A l) (select B l)) (< i N)), 324342#(or (= (select A l) (select B l)) (= l k) (< j M)), 324343#(or (= (select A l) (select B l)) (= l k) (< j M) (not (< i N)) (<= (+ 2 i) N) (= l i)), 324338#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (= l i) (= (+ i 1) l)), 324347#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ i 4) N) (= l k) (not (< j M)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)), 324310#(or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ i 1) N)), 324344#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l k) (< j M) (= l i) (= (+ i 1) l))] [2022-03-15 22:20:09,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:20:09,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:20:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:20:09,680 INFO L87 Difference]: Start difference. First operand 2321 states and 10201 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:12,150 INFO L93 Difference]: Finished difference Result 5007 states and 20482 transitions. [2022-03-15 22:20:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:20:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:12,161 INFO L225 Difference]: With dead ends: 5007 [2022-03-15 22:20:12,161 INFO L226 Difference]: Without dead ends: 4827 [2022-03-15 22:20:12,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1086, Invalid=3336, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:20:12,162 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:12,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:20:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2022-03-15 22:20:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 2599. [2022-03-15 22:20:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2598 states have (on average 4.319476520400308) internal successors, (11222), 2598 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 11222 transitions. [2022-03-15 22:20:12,227 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 11222 transitions. Word has length 17 [2022-03-15 22:20:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:12,227 INFO L470 AbstractCegarLoop]: Abstraction has 2599 states and 11222 transitions. [2022-03-15 22:20:12,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 11222 transitions. [2022-03-15 22:20:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:12,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:12,231 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:12,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-03-15 22:20:12,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 22:20:12,431 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash 962335451, now seen corresponding path program 66 times [2022-03-15 22:20:12,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:12,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856144486] [2022-03-15 22:20:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:12,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:12,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856144486] [2022-03-15 22:20:12,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856144486] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:12,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236858012] [2022-03-15 22:20:12,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:20:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:12,744 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 22:20:12,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:20:12,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:12,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:20:12,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:12,889 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 22:20:12,913 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 16 treesize of output 18 [2022-03-15 22:20:12,993 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:20:12,994 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:20:13,064 INFO L353 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2022-03-15 22:20:13,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 33 [2022-03-15 22:20:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:13,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:13,281 INFO L353 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-03-15 22:20:13,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 66 [2022-03-15 22:20:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:13,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236858012] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:13,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:13,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:13,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946124416] [2022-03-15 22:20:13,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:13,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:13,415 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:20:13,415 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:14,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [334736#(or (= (select A l) (select B l)) (< j M)), 334739#(and (or (<= (+ 3 i) N) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (not (< i N)) (= l i) (= (+ i 1) l))), 334747#(and (or (<= (+ i 4) N) (not (< (+ i 1) N)) (< j M) (= l (+ 2 i)) (not (= l k))) (or (= (select A l) (select B l)) (<= (+ i 4) N) (not (< (+ i 1) N)) (< j M) (= l (+ 2 i)) (= l i) (= (+ i 1) l))), 334740#(and (or (= (select A l) (select B l)) (<= (+ i 4) N) (not (< (+ i 1) N)) (= l (+ 2 i)) (= l i) (= (+ i 1) l)) (or (<= (+ i 4) N) (not (< (+ i 1) N)) (= l (+ 2 i)) (not (= l k)))), 334744#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 334746#(and (or (<= (+ 3 i) N) (< j M) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (not (< i N)) (= l i) (= (+ i 1) l))), 334738#(or (= (select A l) (select B l)) (< j M) (< k N)), 334737#(or (= (select A l) (select B l)) (< k N)), 334742#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 334749#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (<= (+ i 4) N) (not (< (+ i 1) N)) (= (+ j 1) l) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (<= (+ i 4) N) (not (< (+ i 1) N)) (< (+ 2 j) M) (= l (+ 2 i)) (not (= l k)))), 334741#(or (= (select A l) (select B l)) (< j M) (< i N)), 334748#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ i 1) N)) (not (< j M)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ i 1) N)) (not (< j M)) (= l (+ 2 i)) (not (= l k)))), 334743#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 334745#(and (or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)) (or (< j M) (<= (+ 2 i) N) (not (= l k)) (= l i)))] [2022-03-15 22:20:14,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:20:14,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:20:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1444, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:20:14,369 INFO L87 Difference]: Start difference. First operand 2599 states and 11222 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:17,438 INFO L93 Difference]: Finished difference Result 3530 states and 13996 transitions. [2022-03-15 22:20:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:20:17,439 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:17,445 INFO L225 Difference]: With dead ends: 3530 [2022-03-15 22:20:17,446 INFO L226 Difference]: Without dead ends: 3515 [2022-03-15 22:20:17,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1041, Invalid=4965, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 22:20:17,446 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:17,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2022-03-15 22:20:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2633. [2022-03-15 22:20:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2632 states have (on average 4.313449848024316) internal successors, (11353), 2632 states have internal predecessors, (11353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 11353 transitions. [2022-03-15 22:20:17,496 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 11353 transitions. Word has length 17 [2022-03-15 22:20:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:17,497 INFO L470 AbstractCegarLoop]: Abstraction has 2633 states and 11353 transitions. [2022-03-15 22:20:17,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 11353 transitions. [2022-03-15 22:20:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:17,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:17,501 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:17,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:17,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:17,701 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1344329229, now seen corresponding path program 67 times [2022-03-15 22:20:17,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:17,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626166194] [2022-03-15 22:20:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:17,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:17,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626166194] [2022-03-15 22:20:17,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626166194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:17,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958081450] [2022-03-15 22:20:17,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:20:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:17,951 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:17,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 22:20:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:18,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:20:18,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:18,092 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 8 treesize of output 7 [2022-03-15 22:20:18,153 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:20:18,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:20:18,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:18,221 INFO L353 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-03-15 22:20:18,221 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:20:18,257 INFO L353 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2022-03-15 22:20:18,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 33 [2022-03-15 22:20:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:18,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:18,442 INFO L353 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-03-15 22:20:18,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 66 [2022-03-15 22:20:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:18,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958081450] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:18,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:18,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:18,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331581220] [2022-03-15 22:20:18,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:18,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:18,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:20:18,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:19,852 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [343745#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 343752#(and (or (< (+ 2 i) N) (< j M) (= l 0) (= (+ (- 1) N) l) (= l i)) (or (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (not (= l k)) (= l i)) (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (= l i))), 343756#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= l i) (= (+ l 1) N) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (= l 0) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= (+ l 1) N) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (not (< i N)) (< (+ 2 j) M))), 343754#(and (or (<= (+ 3 i) N) (< j M) (not (< i N))) (or (= (select A l) (select B l)) (< j M) (not (< i N)) (< (+ 3 i) N) (= l i) (= (+ l 1) N) (= (+ i 1) l)) (or (< j M) (= l 0) (not (< i N)) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l)) (or (< j M) (not (< i N)) (< (+ 3 i) N) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l))), 343744#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 343746#(or (= (select A l) (select B l)) (< k N)), 343750#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 343742#(or (= (select A l) (select B l)) (< j M)), 343749#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 343753#(and (or (not (< i N)) (< (+ 3 i) N) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (= l 0) (not (< i N)) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l)) (or (= (select A l) (select B l)) (not (< i N)) (< (+ 3 i) N) (= l i) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (not (< i N)))), 343743#(or (= (select A l) (select B l)) (< j M) (< i N)), 343751#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 343748#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 343747#(or (= (select A l) (select B l)) (< j M) (< k N)), 343755#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (= l i) (= (+ l 1) N) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l)) (or (< (+ j 1) M) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< i N)) (not (< j M))))] [2022-03-15 22:20:19,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:20:19,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:19,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:20:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1492, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:20:19,853 INFO L87 Difference]: Start difference. First operand 2633 states and 11353 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:22,742 INFO L93 Difference]: Finished difference Result 3686 states and 14636 transitions. [2022-03-15 22:20:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:20:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:22,750 INFO L225 Difference]: With dead ends: 3686 [2022-03-15 22:20:22,750 INFO L226 Difference]: Without dead ends: 3665 [2022-03-15 22:20:22,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=972, Invalid=4140, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:20:22,751 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:22,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:20:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2022-03-15 22:20:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 2655. [2022-03-15 22:20:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 4.314619442351168) internal successors, (11451), 2654 states have internal predecessors, (11451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 11451 transitions. [2022-03-15 22:20:22,795 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 11451 transitions. Word has length 17 [2022-03-15 22:20:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:22,796 INFO L470 AbstractCegarLoop]: Abstraction has 2655 states and 11451 transitions. [2022-03-15 22:20:22,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 11451 transitions. [2022-03-15 22:20:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:22,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:22,801 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:22,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-03-15 22:20:23,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:23,001 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 163509723, now seen corresponding path program 68 times [2022-03-15 22:20:23,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:23,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534634264] [2022-03-15 22:20:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:23,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:23,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534634264] [2022-03-15 22:20:23,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534634264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:23,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761912954] [2022-03-15 22:20:23,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:20:23,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:23,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:23,265 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 22:20:23,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:20:23,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:23,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:20:23,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:23,469 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 8 treesize of output 7 [2022-03-15 22:20:23,488 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 16 treesize of output 18 [2022-03-15 22:20:23,512 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 23 treesize of output 28 [2022-03-15 22:20:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:23,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:23,612 INFO L353 Elim1Store]: treesize reduction 47, result has 23.0 percent of original size [2022-03-15 22:20:23,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 22:20:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:23,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761912954] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:23,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:23,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:20:23,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738487899] [2022-03-15 22:20:23,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:23,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:23,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:20:23,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:24,768 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [352940#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 352948#(and (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (< j M) (= l 0) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l))), 352952#(and (or (= l (+ (- 2) N)) (<= (+ 2 k) N) (< (+ 2 j) M) (<= M (+ j 1)) (= l i) (< 3 N) (= (+ l 1) N)) (or (< (+ 2 j) M) (<= M (+ j 1)) (= i 0)) (or (<= 3 N) (< (+ 2 j) M) (<= M (+ j 1)))), 352941#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 352950#(and (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (= l (+ (- 2) N)) (<= (+ 2 k) N) (< j M) (= l i) (< 3 N) (= (+ l 1) N))), 352937#(or (= (select A l) (select B l)) (< k N)), 352947#(and (or (< (+ 2 i) N) (< j M) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (< k N) (= l i) (= (+ l 1) N)) (or (< j M) (< k N) (<= (+ 2 i) N))), 352951#(and (or (< (+ j 1) M) (= i 0) (<= M j)) (or (< (+ j 1) M) (<= 3 N) (<= M j)) (or (= l (+ (- 2) N)) (< (+ j 1) M) (<= (+ 2 k) N) (= l i) (< 3 N) (= (+ l 1) N) (<= M j))), 352942#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 352944#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 352938#(or (= (select A l) (select B l)) (< j M) (< k N)), 352943#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 352945#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 352936#(or (= (select A l) (select B l)) (< j M)), 352949#(and (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (= l (+ (- 2) N)) (<= (+ k 1) N) (< j M) (= l i) (< 3 N) (= (+ l 1) N))), 352939#(or (= (select A l) (select B l)) (< j M) (< i N)), 352946#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (< k N) (<= (+ 2 i) N)))] [2022-03-15 22:20:24,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:20:24,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:20:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1732, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:20:24,769 INFO L87 Difference]: Start difference. First operand 2655 states and 11451 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:27,263 INFO L93 Difference]: Finished difference Result 3697 states and 14664 transitions. [2022-03-15 22:20:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:20:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:27,271 INFO L225 Difference]: With dead ends: 3697 [2022-03-15 22:20:27,271 INFO L226 Difference]: Without dead ends: 3669 [2022-03-15 22:20:27,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1515, Invalid=6141, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:20:27,272 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:27,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:20:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2022-03-15 22:20:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2672. [2022-03-15 22:20:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2671 states have (on average 4.31411456383377) internal successors, (11523), 2671 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 11523 transitions. [2022-03-15 22:20:27,326 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 11523 transitions. Word has length 17 [2022-03-15 22:20:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:27,326 INFO L470 AbstractCegarLoop]: Abstraction has 2672 states and 11523 transitions. [2022-03-15 22:20:27,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 11523 transitions. [2022-03-15 22:20:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:27,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:27,330 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:27,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-03-15 22:20:27,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:27,531 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 539849725, now seen corresponding path program 69 times [2022-03-15 22:20:27,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:27,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873424412] [2022-03-15 22:20:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:27,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:27,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873424412] [2022-03-15 22:20:27,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873424412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:27,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431797457] [2022-03-15 22:20:27,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:20:27,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:27,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:27,851 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:27,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 22:20:27,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:20:27,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:27,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:20:27,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:27,961 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 22:20:27,985 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 14 treesize of output 16 [2022-03-15 22:20:28,007 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 16 treesize of output 18 [2022-03-15 22:20:28,063 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-03-15 22:20:28,064 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-03-15 22:20:28,174 INFO L353 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2022-03-15 22:20:28,175 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-03-15 22:20:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:28,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:28,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:28,704 INFO L353 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2022-03-15 22:20:28,704 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 32 treesize of output 62 [2022-03-15 22:20:28,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:28,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 442 treesize of output 438 [2022-03-15 22:20:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:29,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431797457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:29,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:29,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:20:29,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [999739900] [2022-03-15 22:20:29,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:29,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:29,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:20:29,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:29,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [362208#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 362209#(and (or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)) (or (< j M) (<= (+ 2 i) N) (not (= l k)) (= l i))), 362207#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 362203#(or (= (select A l) (select B l)) (< j M) (< k N)), 362201#(or (= (select A l) (select B l)) (< j M)), 362206#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 362205#(or (= (select A l) (select B l)) (< j M) (< i N)), 362210#(and (or (<= (+ 3 i) N) (< j M) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (not (< i N)) (= l i) (= (+ i 1) l))), 362202#(or (= (select A l) (select B l)) (< k N)), 362212#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ i 1) N)) (not (< j M)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ i 1) N)) (not (< j M)) (= l (+ 2 i)) (not (= l k)))), 362211#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (not (< j M)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< i N)) (not (< j M)) (not (= l k)) (= (+ i 1) l))), 362213#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (<= (+ i 4) N) (not (< (+ i 1) N)) (= (+ j 1) l) (< (+ 2 j) M) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (<= (+ i 4) N) (not (< (+ i 1) N)) (< (+ 2 j) M) (= l (+ 2 i)) (not (= l k)))), 362204#(and (or (<= (+ 3 i) N) (not (< i N)) (not (= l k)) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (not (< i N)) (= l i) (= (+ i 1) l)))] [2022-03-15 22:20:29,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:20:29,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:20:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:20:29,958 INFO L87 Difference]: Start difference. First operand 2672 states and 11523 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:36,217 INFO L93 Difference]: Finished difference Result 4107 states and 15819 transitions. [2022-03-15 22:20:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 22:20:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:36,226 INFO L225 Difference]: With dead ends: 4107 [2022-03-15 22:20:36,226 INFO L226 Difference]: Without dead ends: 4065 [2022-03-15 22:20:36,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3461 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2036, Invalid=8884, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 22:20:36,227 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 330 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:36,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2022-03-15 22:20:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 2671. [2022-03-15 22:20:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2670 states have (on average 4.30936329588015) internal successors, (11506), 2670 states have internal predecessors, (11506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11506 transitions. [2022-03-15 22:20:36,273 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11506 transitions. Word has length 17 [2022-03-15 22:20:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:36,273 INFO L470 AbstractCegarLoop]: Abstraction has 2671 states and 11506 transitions. [2022-03-15 22:20:36,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11506 transitions. [2022-03-15 22:20:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:36,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:36,278 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:36,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:36,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:36,491 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1766814955, now seen corresponding path program 70 times [2022-03-15 22:20:36,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:36,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020303280] [2022-03-15 22:20:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:36,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:36,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020303280] [2022-03-15 22:20:36,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020303280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:36,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125993664] [2022-03-15 22:20:36,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:36,756 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:36,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 22:20:36,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:36,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:36,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:20:36,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:36,883 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 22:20:36,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:36,908 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 18 treesize of output 20 [2022-03-15 22:20:36,976 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:20:36,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:20:37,060 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-03-15 22:20:37,060 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:20:37,111 INFO L353 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2022-03-15 22:20:37,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 33 [2022-03-15 22:20:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:37,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:37,331 INFO L353 Elim1Store]: treesize reduction 47, result has 51.5 percent of original size [2022-03-15 22:20:37,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 74 [2022-03-15 22:20:37,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 22:20:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:37,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125993664] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:37,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:37,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:37,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292190479] [2022-03-15 22:20:37,479 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:37,480 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:37,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:20:37,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:38,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [371919#(or (= (select A l) (select B l)) (< j M) (< k N)), 371925#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 371926#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 371928#(and (or (< (+ j 1) M) (< (+ 2 i) N) (= l 0) (not (< j M)) (= l i) (= (+ l 1) N)) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (not (= l k)) (= l i) (= (+ l 1) N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= l i) (= (+ l 1) N) (= l j))), 371920#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 371929#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (= l i) (= (+ l 1) N) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l)) (or (< (+ j 1) M) (not (< i N)) (not (< j M)) (< (+ 3 i) N) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< i N)) (not (< j M)))), 371921#(or (= (select A l) (select B l)) (< j M) (< i N)), 371927#(and (or (< (+ 2 i) N) (< j M) (= l 0) (= (+ (- 1) N) l) (= l i)) (or (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (not (= l k)) (= l i)) (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= (+ (- 1) N) l) (= l i))), 371924#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 371918#(or (= (select A l) (select B l)) (< j M)), 371917#(or (= (select A l) (select B l)) (< k N)), 371930#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= l i) (= (+ l 1) N) (= l j) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (= l 0) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (= (+ l 1) N) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< i N)) (< (+ 3 i) N) (< (+ 2 j) M) (not (= l k)) (= (+ l 1) N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (not (< i N)) (< (+ 2 j) M))), 371923#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 371922#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N))] [2022-03-15 22:20:38,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:20:38,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:20:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:20:38,615 INFO L87 Difference]: Start difference. First operand 2671 states and 11506 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:43,957 INFO L93 Difference]: Finished difference Result 4248 states and 16105 transitions. [2022-03-15 22:20:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:20:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:43,967 INFO L225 Difference]: With dead ends: 4248 [2022-03-15 22:20:43,967 INFO L226 Difference]: Without dead ends: 4218 [2022-03-15 22:20:43,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1456, Invalid=6376, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:20:43,967 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:43,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2022-03-15 22:20:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 2669. [2022-03-15 22:20:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 4.31071964017991) internal successors, (11501), 2668 states have internal predecessors, (11501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 11501 transitions. [2022-03-15 22:20:44,017 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 11501 transitions. Word has length 17 [2022-03-15 22:20:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:44,017 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 11501 transitions. [2022-03-15 22:20:44,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 11501 transitions. [2022-03-15 22:20:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:44,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:44,022 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:44,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:44,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:44,222 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1851058945, now seen corresponding path program 71 times [2022-03-15 22:20:44,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:44,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780617734] [2022-03-15 22:20:44,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:44,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:44,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780617734] [2022-03-15 22:20:44,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780617734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:44,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551641016] [2022-03-15 22:20:44,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:20:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:44,493 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:44,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 22:20:44,572 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:20:44,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:44,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:20:44,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:44,640 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 22:20:44,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,717 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 20 treesize of output 22 [2022-03-15 22:20:44,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,747 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 22:20:44,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,791 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 29 treesize of output 34 [2022-03-15 22:20:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:44,854 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 31 treesize of output 36 [2022-03-15 22:20:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:44,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:45,092 INFO L353 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2022-03-15 22:20:45,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 50 [2022-03-15 22:20:45,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 3826 treesize of output 3794 [2022-03-15 22:20:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:47,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551641016] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:47,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:47,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:47,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945512913] [2022-03-15 22:20:47,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:47,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:47,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:20:47,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:48,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [381743#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 381737#(or (= (select A l) (select B l)) (< j M) (< i N)), 381739#(or (= (select A l) (select B l)) (< j M) (< k N)), 381741#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 381744#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 381742#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 381735#(and (or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) k) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ k 1) l) (= (+ i 1) l)) (or (<= (+ i 1) k) (not (< i N)))), 381745#(and (or (= (select A l) (select B l)) (<= (+ i 1) k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= i k)) (or (<= (+ i 1) k) (< j M) (= l 0) (<= (+ l i 1) (+ N k)) (= l i)) (or (<= (+ i 1) k) (< j M) (= l 0) (= l i) (<= (+ k 1) l))), 381747#(and (or (< (+ j 1) M) (<= (+ i 1) k) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ k 1) l) (= (+ i 1) l))), 381738#(or (= (select A l) (select B l)) (< k N)), 381740#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 381746#(and (or (= (select A l) (select B l)) (< j M) (not (< i N)) (<= (+ 2 i) k) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (<= (+ i 1) k) (< j M) (not (< i N))) (or (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ k 1) l) (= (+ i 1) l)) (or (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l))), 381736#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:20:48,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:20:48,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:20:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:20:48,665 INFO L87 Difference]: Start difference. First operand 2669 states and 11501 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:52,335 INFO L93 Difference]: Finished difference Result 4214 states and 16910 transitions. [2022-03-15 22:20:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:20:52,336 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:52,345 INFO L225 Difference]: With dead ends: 4214 [2022-03-15 22:20:52,345 INFO L226 Difference]: Without dead ends: 4160 [2022-03-15 22:20:52,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1286, Invalid=6370, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:20:52,346 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:52,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2022-03-15 22:20:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 2727. [2022-03-15 22:20:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 4.3162142333088775) internal successors, (11766), 2726 states have internal predecessors, (11766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 11766 transitions. [2022-03-15 22:20:52,404 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 11766 transitions. Word has length 17 [2022-03-15 22:20:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:52,405 INFO L470 AbstractCegarLoop]: Abstraction has 2727 states and 11766 transitions. [2022-03-15 22:20:52,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 11766 transitions. [2022-03-15 22:20:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:52,409 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:52,409 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:52,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2022-03-15 22:20:52,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-03-15 22:20:52,610 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash -998712865, now seen corresponding path program 72 times [2022-03-15 22:20:52,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:52,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393219197] [2022-03-15 22:20:52,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:52,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:52,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393219197] [2022-03-15 22:20:52,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393219197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:52,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745036242] [2022-03-15 22:20:52,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:20:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:52,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:52,891 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:52,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 22:20:52,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:20:52,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:52,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:20:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:53,033 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 22:20:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,104 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 22:20:53,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,144 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 29 treesize of output 34 [2022-03-15 22:20:53,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:53,221 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 22:20:53,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:53,261 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 31 treesize of output 36 [2022-03-15 22:20:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:53,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:53,606 INFO L353 Elim1Store]: treesize reduction 47, result has 51.5 percent of original size [2022-03-15 22:20:53,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 76 [2022-03-15 22:20:53,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:53,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:53,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:53,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-03-15 22:20:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:53,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745036242] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:53,764 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:53,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:53,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820462042] [2022-03-15 22:20:53,764 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:53,765 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:53,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:20:53,768 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:54,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [391639#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 391644#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 391645#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 391638#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 391641#(or (= (select A l) (select B l)) (< j M) (< k N)), 391642#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 391647#(and (or (= (select A l) (select B l)) (< j M) (not (< i N)) (<= (+ 2 i) k) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (<= (+ i 1) k) (< j M) (not (< i N))) (or (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ k 1) l) (= (+ i 1) l)) (or (< j M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l))), 391646#(and (or (= (select A l) (select B l)) (<= (+ i 1) k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= i k)) (or (<= (+ i 1) k) (< j M) (= l 0) (<= (+ l i 1) (+ N k)) (= l i)) (or (<= (+ i 1) k) (< j M) (= l 0) (= l i) (<= (+ k 1) l))), 391648#(and (or (< (+ j 1) M) (<= (+ i 1) k) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (< (+ j 1) M) (= l 0) (not (< i N)) (<= (+ 2 i) k) (not (< j M)) (<= (+ k 1) l) (= (+ i 1) l))), 391636#(or (= (select A l) (select B l)) (< k N)), 391643#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 391635#(or (= (select A l) (select B l)) (< j M) (< i N)), 391640#(and (or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) k) (not (= l 0)) (= l i) (= (+ i 1) l)) (or (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= (+ i 1) l)) (or (= l 0) (not (< i N)) (<= (+ 2 i) k) (<= (+ k 1) l) (= (+ i 1) l)) (or (<= (+ i 1) k) (not (< i N)))), 391634#(or (= (select A l) (select B l)) (< j M)), 391637#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i))] [2022-03-15 22:20:54,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:20:54,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:20:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:20:54,994 INFO L87 Difference]: Start difference. First operand 2727 states and 11766 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:58,068 INFO L93 Difference]: Finished difference Result 3918 states and 15785 transitions. [2022-03-15 22:20:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:20:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:20:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:58,076 INFO L225 Difference]: With dead ends: 3918 [2022-03-15 22:20:58,076 INFO L226 Difference]: Without dead ends: 3873 [2022-03-15 22:20:58,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1101, Invalid=5541, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 22:20:58,077 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:58,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:20:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-03-15 22:20:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 2828. [2022-03-15 22:20:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 4.328970640254687) internal successors, (12238), 2827 states have internal predecessors, (12238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 12238 transitions. [2022-03-15 22:20:58,124 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 12238 transitions. Word has length 17 [2022-03-15 22:20:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:58,124 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 12238 transitions. [2022-03-15 22:20:58,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 12238 transitions. [2022-03-15 22:20:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:58,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:58,129 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:58,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:58,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 22:20:58,344 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash -796744559, now seen corresponding path program 73 times [2022-03-15 22:20:58,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:58,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149237360] [2022-03-15 22:20:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:58,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:58,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149237360] [2022-03-15 22:20:58,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149237360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:58,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619442096] [2022-03-15 22:20:58,571 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:20:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:58,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:58,572 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:20:58,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 22:20:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:58,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:20:58,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:58,749 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 22:20:58,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,780 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 22:20:58,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,817 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 29 treesize of output 34 [2022-03-15 22:20:58,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:58,874 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 31 treesize of output 36 [2022-03-15 22:20:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:58,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:59,043 INFO L353 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2022-03-15 22:20:59,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 45 [2022-03-15 22:20:59,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:59,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 214 treesize of output 210 [2022-03-15 22:20:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:59,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619442096] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:59,346 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:59,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:20:59,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688738737] [2022-03-15 22:20:59,346 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:59,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:59,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:20:59,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:00,065 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [401433#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 401430#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 401427#(or (= (select A l) (select B l)) (< k N)), 401425#(or (= (select A l) (select B l)) (< j M)), 401432#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 401428#(or (= (select A l) (select B l)) (< j M) (< k N)), 401426#(or (= (select A l) (select B l)) (< j M) (< i N)), 401431#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 401436#(and (or (< (+ j 1) M) (= l k) (<= (+ 2 l) (+ N k)) (= l 0) (<= M j) (< 1 k)) (or (< (+ j 1) M) (= i 0) (<= M j)) (or (< (+ j 1) M) (= l k) (= l 0) (<= (+ k 1) l) (<= M j) (< 1 k)) (or (< (+ j 1) M) (<= 1 k) (<= M j))), 401429#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 401435#(and (or (= l k) (<= (+ 2 l) (+ N k)) (< j M) (= l 0) (< 1 k)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (= l k) (< j M) (= l 0) (<= (+ k 1) l) (< 1 k))), 401434#(and (or (< j M) (<= 2 k)) (or (< j M) (= i 0)) (or (< k (+ l 1)) (< j M) (= l 0) (< 2 k) (= (+ (- 1) k) l)) (or (< j M) (<= l k) (< 2 k) (<= (+ 3 l) (+ N k))))] [2022-03-15 22:21:00,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:21:00,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:21:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:21:00,066 INFO L87 Difference]: Start difference. First operand 2828 states and 12238 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:01,621 INFO L93 Difference]: Finished difference Result 4189 states and 16702 transitions. [2022-03-15 22:21:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:21:01,622 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:01,631 INFO L225 Difference]: With dead ends: 4189 [2022-03-15 22:21:01,631 INFO L226 Difference]: Without dead ends: 4155 [2022-03-15 22:21:01,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=818, Invalid=4012, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:21:01,631 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:01,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2022-03-15 22:21:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 2851. [2022-03-15 22:21:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 4.327719298245614) internal successors, (12334), 2850 states have internal predecessors, (12334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 12334 transitions. [2022-03-15 22:21:01,683 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 12334 transitions. Word has length 17 [2022-03-15 22:21:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:01,683 INFO L470 AbstractCegarLoop]: Abstraction has 2851 states and 12334 transitions. [2022-03-15 22:21:01,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 12334 transitions. [2022-03-15 22:21:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:01,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:01,688 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:01,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:01,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:01,888 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 648450927, now seen corresponding path program 74 times [2022-03-15 22:21:01,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:01,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028782463] [2022-03-15 22:21:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:02,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:02,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028782463] [2022-03-15 22:21:02,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028782463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:02,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772689387] [2022-03-15 22:21:02,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:02,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:02,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:02,094 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:02,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 22:21:02,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:02,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:02,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:21:02,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:02,274 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 22:21:02,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:02,301 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 18 treesize of output 20 [2022-03-15 22:21:02,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:02,350 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 22:21:02,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:02,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:02,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:02,378 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 31 treesize of output 36 [2022-03-15 22:21:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:02,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:02,546 INFO L353 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2022-03-15 22:21:02,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 40 [2022-03-15 22:21:02,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:02,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:02,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 22:21:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:02,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772689387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:02,741 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:02,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:21:02,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115194283] [2022-03-15 22:21:02,741 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:02,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:02,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:21:02,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:03,632 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [411516#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 411513#(or (= (select A l) (select B l)) (< j M) (< i N)), 411518#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 411521#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 411512#(or (= (select A l) (select B l)) (< j M)), 411524#(and (or (= l k) (<= (+ 2 l) (+ N k)) (< j M) (= l 0) (< 1 k)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (= l k) (< j M) (= l 0) (<= (+ k 1) l) (< 1 k))), 411522#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M))), 411514#(or (= (select A l) (select B l)) (< k N)), 411523#(and (or (< j M) (<= 2 k)) (or (< j M) (= i 0)) (or (< k (+ l 1)) (< j M) (= l 0) (< 2 k) (= (+ (- 1) k) l)) (or (< j M) (<= l k) (< 2 k) (<= (+ 3 l) (+ N k)))), 411525#(and (or (< (+ j 1) M) (= l k) (<= (+ 2 l) (+ N k)) (= l 0) (<= M j) (< 1 k)) (or (< (+ j 1) M) (= i 0) (<= M j)) (or (< (+ j 1) M) (= l k) (= l 0) (<= (+ k 1) l) (<= M j) (< 1 k)) (or (< (+ j 1) M) (<= 1 k) (<= M j))), 411520#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 411519#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 411517#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 411515#(or (= (select A l) (select B l)) (< j M) (< k N))] [2022-03-15 22:21:03,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:21:03,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:21:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:21:03,633 INFO L87 Difference]: Start difference. First operand 2851 states and 12334 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:05,189 INFO L93 Difference]: Finished difference Result 3783 states and 15085 transitions. [2022-03-15 22:21:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 22:21:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:05,197 INFO L225 Difference]: With dead ends: 3783 [2022-03-15 22:21:05,197 INFO L226 Difference]: Without dead ends: 3751 [2022-03-15 22:21:05,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=772, Invalid=3920, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 22:21:05,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:05,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-03-15 22:21:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2861. [2022-03-15 22:21:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 4.326573426573426) internal successors, (12374), 2860 states have internal predecessors, (12374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 12374 transitions. [2022-03-15 22:21:05,246 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 12374 transitions. Word has length 17 [2022-03-15 22:21:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:05,246 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 12374 transitions. [2022-03-15 22:21:05,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 12374 transitions. [2022-03-15 22:21:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:05,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:05,251 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:05,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-03-15 22:21:05,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:05,452 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1795129263, now seen corresponding path program 75 times [2022-03-15 22:21:05,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:05,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542968609] [2022-03-15 22:21:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:05,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:05,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542968609] [2022-03-15 22:21:05,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542968609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:05,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637451623] [2022-03-15 22:21:05,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:05,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:05,683 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:05,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 22:21:05,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:21:05,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:05,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:21:05,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:05,893 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 22:21:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:05,920 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 20 treesize of output 22 [2022-03-15 22:21:05,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:05,970 INFO L353 Elim1Store]: treesize reduction 38, result has 25.5 percent of original size [2022-03-15 22:21:05,971 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:21:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:06,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:06,227 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:21:06,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:21:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:06,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637451623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:06,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:06,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 22:21:06,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052960143] [2022-03-15 22:21:06,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:06,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:06,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:21:06,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:07,604 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [421222#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 421211#(or (= (select A l) (select B l)) (< k N)), 421215#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 421223#(and (or (< (+ 2 i) N) (< j M) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (< k N) (= l i) (= (+ l 1) N)) (or (< j M) (< k N) (<= (+ 2 i) N))), 421214#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 421221#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 421220#(or (= (select A l) (select B l)) (< j M) (< k N)), 421225#(and (or (< j M) (<= 2 k)) (or (< j M) (= i 0)) (or (< k (+ l 1)) (< j M) (= l 0) (< 2 k) (= (+ (- 1) k) l)) (or (<= (+ l 1) N) (< j M) (<= l k) (< 2 k))), 421212#(or (= (select A l) (select B l)) (< j M)), 421217#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 421218#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 421224#(and (or (= l (+ (- 2) N)) (<= (+ k 1) N) (< j M) (= l 0) (< 3 N) (= (+ l 1) N)) (or (< j M) (= i 0)) (or (<= 3 N) (< j M))), 421226#(and (or (<= (+ l 1) N) (= l k) (< j M) (= l 0) (< 1 k)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (= l k) (< j M) (= l 0) (<= (+ k 1) l) (< 1 k))), 421219#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (< k N) (<= (+ 2 i) N))), 421216#(and (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (< j M) (= l 0) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l))), 421227#(and (or (<= (+ l 1) N) (< (+ j 1) M) (= l k) (= l 0) (<= M j) (< 1 k)) (or (< (+ j 1) M) (= i 0) (<= M j)) (or (< (+ j 1) M) (= l k) (= l 0) (<= (+ k 1) l) (<= M j) (< 1 k)) (or (< (+ j 1) M) (<= 1 k) (<= M j))), 421213#(or (= (select A l) (select B l)) (< j M) (< i N))] [2022-03-15 22:21:07,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:21:07,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:21:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1842, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:21:07,605 INFO L87 Difference]: Start difference. First operand 2861 states and 12374 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:09,263 INFO L93 Difference]: Finished difference Result 3787 states and 15156 transitions. [2022-03-15 22:21:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:21:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:09,272 INFO L225 Difference]: With dead ends: 3787 [2022-03-15 22:21:09,272 INFO L226 Difference]: Without dead ends: 3761 [2022-03-15 22:21:09,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=900, Invalid=4650, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 22:21:09,273 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:09,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2022-03-15 22:21:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 2859. [2022-03-15 22:21:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 4.328551434569629) internal successors, (12371), 2858 states have internal predecessors, (12371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 12371 transitions. [2022-03-15 22:21:09,320 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 12371 transitions. Word has length 17 [2022-03-15 22:21:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:09,321 INFO L470 AbstractCegarLoop]: Abstraction has 2859 states and 12371 transitions. [2022-03-15 22:21:09,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 12371 transitions. [2022-03-15 22:21:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:09,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:09,325 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:09,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-03-15 22:21:09,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-15 22:21:09,526 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1332495461, now seen corresponding path program 24 times [2022-03-15 22:21:09,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:09,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863601791] [2022-03-15 22:21:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:09,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:09,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863601791] [2022-03-15 22:21:09,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863601791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:09,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258145732] [2022-03-15 22:21:09,776 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:21:09,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:09,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:09,777 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:09,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 22:21:09,844 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:21:09,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:09,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:21:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:09,955 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 22:21:09,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:09,987 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 20 treesize of output 22 [2022-03-15 22:21:10,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:10,015 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 20 treesize of output 22 [2022-03-15 22:21:10,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:10,067 INFO L353 Elim1Store]: treesize reduction 38, result has 25.5 percent of original size [2022-03-15 22:21:10,067 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:21:10,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:10,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:10,186 INFO L353 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-03-15 22:21:10,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2022-03-15 22:21:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:10,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:10,508 INFO L353 Elim1Store]: treesize reduction 30, result has 66.3 percent of original size [2022-03-15 22:21:10,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 83 [2022-03-15 22:21:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:10,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258145732] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:10,692 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:10,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:21:10,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601746597] [2022-03-15 22:21:10,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:10,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:10,696 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:21:10,696 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:11,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [430919#(and (or (<= (+ l 1) N) (<= (+ 2 k) i) (= l k) (< j M) (= l 0)) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (not (<= l 0))) (or (<= (+ 2 k) i) (= l k) (< j M) (= l 0) (<= (+ k 1) l)) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= (+ k 1) i))), 430922#(and (or (<= (+ l 1) N) (< j M) (= l 0)) (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (= l 0) (< 0 l)) (or (< j M) (<= i 0)) (or (<= k i) (< j M))), 430920#(and (or (< j M) (not (= k i)) (= l 0) (< i (+ l 1))) (or (= (select A l) (select B l)) (< j M) (not (= k i)) (not (= l 0)) (= l i)) (or (< j M) (not (= k i)) (= l 0) (not (<= l 0)) (= l i)) (or (<= k i) (< j M)) (or (<= (+ l 1) N) (< j M) (not (= k i)) (= l 0) (= l i))), 430917#(and (or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)) (or (= (select A l) (select B l)) (<= k i) (< j M) (< 0 l) (= l i))), 430921#(and (or (<= (+ l 1) N) (< j M) (= l 0)) (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (= l 0) (< 0 l)) (or (< j M) (<= i 0)) (or (< j M) (<= k (+ i 1)))), 430915#(or (= (select A l) (select B l)) (< j M) (< k N)), 430916#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 430913#(or (= (select A l) (select B l)) (< k N)), 430918#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (<= (+ l 1) N) (= (select A l) (select B l)) (= l k) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 430914#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:21:11,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:21:11,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:11,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:21:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1149, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:21:11,444 INFO L87 Difference]: Start difference. First operand 2859 states and 12371 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:13,340 INFO L93 Difference]: Finished difference Result 3238 states and 13538 transitions. [2022-03-15 22:21:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 22:21:13,341 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:13,348 INFO L225 Difference]: With dead ends: 3238 [2022-03-15 22:21:13,348 INFO L226 Difference]: Without dead ends: 3228 [2022-03-15 22:21:13,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=763, Invalid=4067, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:21:13,348 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:13,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:21:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-03-15 22:21:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2879. [2022-03-15 22:21:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2878 states have (on average 4.3245309242529535) internal successors, (12446), 2878 states have internal predecessors, (12446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 12446 transitions. [2022-03-15 22:21:13,391 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 12446 transitions. Word has length 17 [2022-03-15 22:21:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:13,391 INFO L470 AbstractCegarLoop]: Abstraction has 2879 states and 12446 transitions. [2022-03-15 22:21:13,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 12446 transitions. [2022-03-15 22:21:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:13,395 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:13,395 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:13,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-03-15 22:21:13,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:13,599 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -797265659, now seen corresponding path program 25 times [2022-03-15 22:21:13,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:13,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112088422] [2022-03-15 22:21:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:13,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:13,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112088422] [2022-03-15 22:21:13,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112088422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:13,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100900404] [2022-03-15 22:21:13,814 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:21:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:13,815 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:13,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 22:21:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:13,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:21:13,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:13,974 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 22:21:14,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,001 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 22:21:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,031 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 22:21:14,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,067 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 29 treesize of output 34 [2022-03-15 22:21:14,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:14,136 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 31 treesize of output 36 [2022-03-15 22:21:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:14,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:14,438 INFO L353 Elim1Store]: treesize reduction 42, result has 56.7 percent of original size [2022-03-15 22:21:14,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 81 [2022-03-15 22:21:14,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 514 [2022-03-15 22:21:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:14,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100900404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:14,753 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:14,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:21:14,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325095008] [2022-03-15 22:21:14,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:14,754 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:14,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:21:14,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:15,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [440107#(or (= (select A l) (select B l)) (< k N)), 440114#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (< 0 l)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 440115#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (< 0 l) (= l i))), 440116#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= l k) (< j M) (not (= k i)) (= l 0) (not (<= l 0))) (or (< j M) (<= i k)) (or (< k (+ l 1)) (< j M) (not (= k i)) (= l 0)) (or (= l k) (< j M) (not (= k i)) (= l 0) (<= (+ l i 1) (+ N k)))), 440110#(or (= (select A l) (select B l)) (< j M) (< i N)), 440118#(and (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= k 0) (= l 0)) (or (< j M) (<= i k)) (or (< j M) (= l 0) (<= (+ l i 1) (+ N k))) (or (< j M) (= l 0) (not (<= l 0)))), 440113#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 440109#(or (= (select A l) (select B l)) (< j M)), 440108#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 440111#(or (= (select A l) (select B l)) (< j M) (< k N)), 440112#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 440117#(and (or (< k (+ l 1)) (< j M) (= l 0)) (or (= l k) (< j M) (= l 0) (<= (+ 2 l i) (+ N k))) (or (= l k) (< j M) (not (= l 0)) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (not (<= l 0))))] [2022-03-15 22:21:15,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:21:15,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:21:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:21:15,601 INFO L87 Difference]: Start difference. First operand 2879 states and 12446 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:17,164 INFO L93 Difference]: Finished difference Result 3538 states and 14894 transitions. [2022-03-15 22:21:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 22:21:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:17,172 INFO L225 Difference]: With dead ends: 3538 [2022-03-15 22:21:17,172 INFO L226 Difference]: Without dead ends: 3529 [2022-03-15 22:21:17,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=875, Invalid=3547, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:21:17,173 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:17,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2022-03-15 22:21:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2893. [2022-03-15 22:21:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2892 states have (on average 4.3212309820193635) internal successors, (12497), 2892 states have internal predecessors, (12497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 12497 transitions. [2022-03-15 22:21:17,216 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 12497 transitions. Word has length 17 [2022-03-15 22:21:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:17,217 INFO L470 AbstractCegarLoop]: Abstraction has 2893 states and 12497 transitions. [2022-03-15 22:21:17,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 12497 transitions. [2022-03-15 22:21:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:17,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:17,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:17,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:17,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:17,422 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 647929827, now seen corresponding path program 26 times [2022-03-15 22:21:17,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:17,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45766263] [2022-03-15 22:21:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:17,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:17,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45766263] [2022-03-15 22:21:17,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45766263] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:17,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177196058] [2022-03-15 22:21:17,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:17,639 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:17,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 22:21:17,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:17,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:17,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:21:17,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:17,787 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 8 treesize of output 7 [2022-03-15 22:21:17,815 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:21:17,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:21:17,869 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-03-15 22:21:17,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:21:18,004 INFO L353 Elim1Store]: treesize reduction 72, result has 18.2 percent of original size [2022-03-15 22:21:18,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:21:18,090 INFO L353 Elim1Store]: treesize reduction 72, result has 18.2 percent of original size [2022-03-15 22:21:18,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:21:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:21:18,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:18,374 INFO L353 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-03-15 22:21:18,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 48 [2022-03-15 22:21:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:21:18,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177196058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:18,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:18,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-03-15 22:21:18,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178088338] [2022-03-15 22:21:18,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:18,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:18,524 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:21:18,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:19,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [449628#(and (or (< k (+ l 1)) (< j M) (= l 0)) (or (= l k) (< j M) (= l 0) (<= (+ 2 l i) (+ N k))) (or (= l k) (< j M) (not (= l 0)) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (not (<= l 0)))), 449619#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 449587#(or (= (select A l) (select B l)) (< k N)), 449621#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 449627#(and (or (= (select A l) (select B l)) (= l k) (< j M) (not (= k i)) (not (= l 0))) (or (= l k) (< j M) (not (= k i)) (= l 0) (not (<= l 0))) (or (< k (+ l 1)) (< j M) (not (= k i)) (= l 0)) (or (= l k) (< j M) (not (= k i)) (= l 0) (<= (+ l i 1) (+ N k))) (or (< j M) (< i (+ k 1)))), 449626#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (< 0 l) (= l i))), 449617#(or (= (select A l) (select B l)) (< j M)), 449625#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 449618#(or (= (select A l) (select B l)) (< j M) (< i N)), 449624#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 449623#(or (= (select A l) (select B l)) (< j M) (< k N)), 449622#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 449620#(and (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< j M) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 449629#(and (or (< j M) (not (= l 0)) (= l i)) (or (< j M) (<= k 0) (= l 0)) (or (< j M) (<= i k)) (or (< j M) (= l 0) (<= (+ l i 1) (+ N k))) (or (< j M) (= l 0) (not (<= l 0))))] [2022-03-15 22:21:19,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:21:19,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:21:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:21:19,398 INFO L87 Difference]: Start difference. First operand 2893 states and 12497 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:20,706 INFO L93 Difference]: Finished difference Result 3263 states and 13727 transitions. [2022-03-15 22:21:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:21:20,707 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:20,713 INFO L225 Difference]: With dead ends: 3263 [2022-03-15 22:21:20,713 INFO L226 Difference]: Without dead ends: 3253 [2022-03-15 22:21:20,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=659, Invalid=2763, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:21:20,714 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:20,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2022-03-15 22:21:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2897. [2022-03-15 22:21:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 4.3194060773480665) internal successors, (12509), 2896 states have internal predecessors, (12509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 12509 transitions. [2022-03-15 22:21:20,772 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 12509 transitions. Word has length 17 [2022-03-15 22:21:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:20,773 INFO L470 AbstractCegarLoop]: Abstraction has 2897 states and 12509 transitions. [2022-03-15 22:21:20,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 12509 transitions. [2022-03-15 22:21:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:20,777 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:20,777 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:20,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-03-15 22:21:20,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 22:21:20,978 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 60184505, now seen corresponding path program 27 times [2022-03-15 22:21:20,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:20,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9699382] [2022-03-15 22:21:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:21,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:21,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9699382] [2022-03-15 22:21:21,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9699382] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:21,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381314138] [2022-03-15 22:21:21,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:21,192 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 22:21:21,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:21:21,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:21,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:21:21,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:21,360 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 8 treesize of output 7 [2022-03-15 22:21:21,393 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:21:21,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:21:21,495 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-03-15 22:21:21,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:21:21,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:21,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:21,563 INFO L353 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2022-03-15 22:21:21,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 42 [2022-03-15 22:21:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:21,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:21,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:21,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:22,022 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:21:22,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 49 [2022-03-15 22:21:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:22,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381314138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:22,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:22,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 22:21:22,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1289545890] [2022-03-15 22:21:22,176 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:22,177 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:22,180 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:21:22,180 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:23,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [458866#(and (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (<= (+ 2 l i) (+ N k)) (= l i)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ 2 i) k) (not (= l 0)) (= l i)) (or (< k (+ l 1)) (< j M) (= l 0) (<= (+ 2 i) k) (= l i)) (or (<= (+ i 1) k) (< j M)) (or (= l k) (< j M) (= l 0) (<= (+ 2 i) k) (< 0 l) (= l i))), 458856#(or (= (select A l) (select B l)) (< j M)), 458865#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 458861#(or (= (select A l) (select B l)) (< j M) (< k N)), 458858#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 458868#(and (or (< k (+ l 1)) (< j M) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (= l k) (<= (+ 2 l) (+ N k)) (< j M) (= l 0))), 458864#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 458867#(and (or (< j M) (<= 2 k)) (or (< j M) (= i 0)) (or (< j M) (= l 0) (< 2 k) (< 0 l)) (or (< j M) (<= l k) (< 2 k) (<= (+ 3 l) (+ N k)))), 458857#(or (= (select A l) (select B l)) (< j M) (< i N)), 458859#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N))), 458860#(or (= (select A l) (select B l)) (< k N)), 458863#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 458862#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 458869#(and (or (< j M) (<= k 0) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (<= 0 k)) (or (< j M) (= l 0) (<= (+ l 1) (+ N k))) (or (< j M) (= l 0) (not (<= l 0))))] [2022-03-15 22:21:23,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:21:23,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:21:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:21:23,019 INFO L87 Difference]: Start difference. First operand 2897 states and 12509 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:24,233 INFO L93 Difference]: Finished difference Result 3284 states and 13761 transitions. [2022-03-15 22:21:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:21:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:24,240 INFO L225 Difference]: With dead ends: 3284 [2022-03-15 22:21:24,240 INFO L226 Difference]: Without dead ends: 3274 [2022-03-15 22:21:24,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=679, Invalid=3353, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:21:24,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:24,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-03-15 22:21:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2896. [2022-03-15 22:21:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 2895 states have (on average 4.318825561312608) internal successors, (12503), 2895 states have internal predecessors, (12503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 12503 transitions. [2022-03-15 22:21:24,284 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 12503 transitions. Word has length 17 [2022-03-15 22:21:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:24,284 INFO L470 AbstractCegarLoop]: Abstraction has 2896 states and 12503 transitions. [2022-03-15 22:21:24,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 12503 transitions. [2022-03-15 22:21:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:24,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:24,289 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:24,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-03-15 22:21:24,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 22:21:24,489 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1911571611, now seen corresponding path program 28 times [2022-03-15 22:21:24,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:24,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880227243] [2022-03-15 22:21:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:24,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:24,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880227243] [2022-03-15 22:21:24,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880227243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:24,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278818581] [2022-03-15 22:21:24,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:24,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:24,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:24,728 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:24,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 22:21:24,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:24,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:24,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:21:24,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:24,948 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 22:21:24,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:24,971 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 22:21:24,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:24,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:24,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:25,000 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 31 treesize of output 36 [2022-03-15 22:21:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:25,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:25,134 INFO L353 Elim1Store]: treesize reduction 47, result has 23.0 percent of original size [2022-03-15 22:21:25,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 22:21:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:25,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278818581] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:25,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:25,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:21:25,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378871599] [2022-03-15 22:21:25,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:25,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:25,307 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2022-03-15 22:21:25,307 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:26,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [468127#(and (or (< j M) (<= 2 k)) (or (< j M) (= i 0)) (or (< j M) (= l 0) (< 2 k) (< 0 l)) (or (<= (+ l 1) N) (< j M) (<= l k) (< 2 k))), 468121#(or (= (select A l) (select B l)) (< j M) (< k N) (< i N)), 468122#(or (= (select A l) (select B l)) (< k N) (<= (+ 2 i) N) (= l i)), 468123#(or (= (select A l) (select B l)) (< j M) (< k N) (<= (+ 2 i) N) (= l i)), 468114#(or (= (select A l) (select B l)) (< j M) (< i N)), 468115#(or (= (select A l) (select B l)) (< j M) (<= (+ 2 i) N) (= l i)), 468119#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 468128#(and (or (< k (+ l 1)) (< j M) (= l 0)) (or (<= (+ l 1) N) (= l k) (< j M) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (<= 1 k))), 468113#(or (= (select A l) (select B l)) (< j M)), 468126#(and (or (< j M) (= l 0) (< 0 l) (< 3 N)) (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (= l (+ (- 2) N)) (<= (+ k 1) N) (< j M) (= l 0) (= (+ (- 1) N) l) (< 3 N))), 468125#(and (or (< (+ 2 i) N) (< j M) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (< k N) (= l i) (= (+ l 1) N)) (or (< j M) (< k N) (<= (+ 2 i) N))), 468124#(and (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)) (or (< (+ 2 i) N) (= l 0) (< k N) (= l i) (= (+ l 1) N)) (or (< k N) (<= (+ 2 i) N))), 468118#(or (= (select A l) (select B l)) (< k N)), 468120#(or (= (select A l) (select B l)) (< j M) (< k N)), 468117#(and (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (< j M) (= l 0) (< (+ 3 i) N) (= (+ l 1) N) (= (+ i 1) l))), 468129#(and (or (<= (+ l 1) N) (< j M) (= l 0)) (or (< j M) (<= k 0) (= l 0)) (or (< j M) (= i 0)) (or (< j M) (<= 0 k)) (or (< j M) (= l 0) (not (<= l 0)))), 468116#(and (or (< j M) (<= (+ 2 i) N)) (or (= (select A l) (select B l)) (< (+ 2 i) N) (< j M) (= l i) (= (+ l 1) N)) (or (< (+ 2 i) N) (< j M) (= l 0) (= l i) (= (+ l 1) N)))] [2022-03-15 22:21:26,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:21:26,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:21:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:21:26,281 INFO L87 Difference]: Start difference. First operand 2896 states and 12503 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:27,594 INFO L93 Difference]: Finished difference Result 3131 states and 13160 transitions. [2022-03-15 22:21:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:21:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:27,601 INFO L225 Difference]: With dead ends: 3131 [2022-03-15 22:21:27,601 INFO L226 Difference]: Without dead ends: 3124 [2022-03-15 22:21:27,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=778, Invalid=3914, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 22:21:27,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:27,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2022-03-15 22:21:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2896. [2022-03-15 22:21:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 2895 states have (on average 4.318825561312608) internal successors, (12503), 2895 states have internal predecessors, (12503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 12503 transitions. [2022-03-15 22:21:27,645 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 12503 transitions. Word has length 17 [2022-03-15 22:21:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:27,645 INFO L470 AbstractCegarLoop]: Abstraction has 2896 states and 12503 transitions. [2022-03-15 22:21:27,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 12503 transitions. [2022-03-15 22:21:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:27,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:27,650 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:27,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:27,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:27,850 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1965341999, now seen corresponding path program 76 times [2022-03-15 22:21:27,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:27,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172674807] [2022-03-15 22:21:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:28,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:28,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172674807] [2022-03-15 22:21:28,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172674807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:28,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141802041] [2022-03-15 22:21:28,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:28,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:28,151 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:28,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 22:21:28,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:28,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:28,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:21:28,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:28,326 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 22:21:28,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:28,351 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 20 treesize of output 22 [2022-03-15 22:21:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:28,379 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 22:21:28,406 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 23 treesize of output 28 [2022-03-15 22:21:28,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 22:21:28,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:28,604 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:21:28,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 51 [2022-03-15 22:21:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:28,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141802041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:28,759 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:28,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:21:28,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452369939] [2022-03-15 22:21:28,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:28,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:28,762 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 50 transitions. [2022-03-15 22:21:28,762 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:29,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [477230#(and (or (< i (+ M 1)) (< k N)) (or (= (select A l) (select B l)) (not (= (+ M (* (- 1) i)) 0)) (= M l) (< k N) (< 0 l)) (or (= (select A l) (select B l)) (not (= (+ M (* (- 1) i)) 0)) (= M l) (< k N) (<= (+ M i 1) (+ N l))) (or (<= (+ M 1) N) (< k N) (<= M i)) (or (not (= (+ M (* (- 1) i)) 0)) (<= l M) (< k N))), 477225#(or (= (select A l) (select B l)) (< j M) (< k N)), 477233#(and (or (<= l M) (< k N)) (or (<= 1 j) (< k N)) (or (<= j 1) (< k N)) (or (< k N) (= i 0)) (or (= M l) (= l 0) (< k N) (< 0 l)) (or (<= (+ M 1) N) (< k N))), 477226#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i)), 477228#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i)), 477231#(and (or (= (select A l) (select B l)) (not (= (+ M (* (- 1) i)) 0)) (= M l) (< k N) (not (= l 0)) (= l j)) (or (not (= (+ M (* (- 1) i)) 0)) (= M l) (= l 0) (< k N) (= l j) (<= (+ M i 1) (+ N l))) (or (< i (+ M 1)) (<= i (+ j 1)) (< k N)) (or (not (= (+ M (* (- 1) i)) 0)) (= M l) (= l 0) (< k N) (< 0 l) (= l j)) (or (<= (+ M 1) N) (< k N) (<= M i)) (or (not (= (+ M (* (- 1) i)) 0)) (<= l M) (< k N))), 477229#(and (or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)) (or (<= l M) (< k N) (<= (+ i 1) N))), 477224#(or (= (select A l) (select B l)) (< k N)), 477186#(or (= (select A l) (select B l)) (< j M)), 477227#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 477232#(and (or (= M l) (= l 0) (< k N) (< 0 l) (= l i)) (or (<= l M) (< k N)) (or (<= j i) (< k N)) (or (= M l) (= l 0) (< k N) (< i (+ l 1))) (or (= (select A l) (select B l)) (= M l) (< k N) (not (= l 0)) (= l i)) (or (< i (+ j 1)) (< k N)) (or (<= (+ M 1) N) (< k N)))] [2022-03-15 22:21:29,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:21:29,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:21:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:21:29,573 INFO L87 Difference]: Start difference. First operand 2896 states and 12503 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:31,576 INFO L93 Difference]: Finished difference Result 3091 states and 13056 transitions. [2022-03-15 22:21:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:21:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:31,583 INFO L225 Difference]: With dead ends: 3091 [2022-03-15 22:21:31,583 INFO L226 Difference]: Without dead ends: 3080 [2022-03-15 22:21:31,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=598, Invalid=3562, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:21:31,584 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:31,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2022-03-15 22:21:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2900. [2022-03-15 22:21:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2899 states have (on average 4.318040703690928) internal successors, (12518), 2899 states have internal predecessors, (12518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 12518 transitions. [2022-03-15 22:21:31,625 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 12518 transitions. Word has length 17 [2022-03-15 22:21:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:31,625 INFO L470 AbstractCegarLoop]: Abstraction has 2900 states and 12518 transitions. [2022-03-15 22:21:31,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 12518 transitions. [2022-03-15 22:21:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:31,630 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:31,630 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:31,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-03-15 22:21:31,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:31,830 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1110035345, now seen corresponding path program 77 times [2022-03-15 22:21:31,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:31,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311944896] [2022-03-15 22:21:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:32,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:32,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311944896] [2022-03-15 22:21:32,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311944896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:32,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246946236] [2022-03-15 22:21:32,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:32,165 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:32,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 22:21:32,238 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:21:32,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:32,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:21:32,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:32,366 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 22:21:32,396 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 14 treesize of output 16 [2022-03-15 22:21:32,420 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 16 treesize of output 18 [2022-03-15 22:21:32,451 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 23 treesize of output 28 [2022-03-15 22:21:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:32,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:32,646 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:21:32,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 51 [2022-03-15 22:21:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:32,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246946236] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:32,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:32,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 22:21:32,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2105313154] [2022-03-15 22:21:32,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:32,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:32,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 55 transitions. [2022-03-15 22:21:32,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:33,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [486307#(and (or (not (= (+ M (* (- 1) i)) 0)) (<= l M) (< k N) (= l j)) (or (= (select A l) (select B l)) (not (= (+ M (* (- 1) i)) 0)) (= M l) (< k N) (not (= l 0)) (= l j)) (or (not (= (+ M (* (- 1) i)) 0)) (= M l) (= l 0) (< k N) (= l j) (<= (+ M i 1) (+ N l))) (or (not (= (+ M (* (- 1) i)) 0)) (= M l) (= l 0) (< k N) (< 0 l) (= l j)) (or (<= (+ M 1) N) (< k N) (= l j) (<= M i)) (or (< i (+ M 1)) (< k N) (<= N (+ M 1)) (= l j))), 486304#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (= l j)), 486309#(and (or (<= l M) (< k N)) (or (<= 1 j) (< k N)) (or (<= j 1) (< k N)) (or (< k N) (= i 0)) (or (< k N) (<= N (+ M 1))) (or (= M l) (= l 0) (< k N) (< 0 l)) (or (<= (+ M 1) N) (< k N))), 486301#(or (= (select A l) (select B l)) (< k N)), 486302#(or (= (select A l) (select B l)) (< j M) (< k N)), 486308#(and (or (= M l) (= l 0) (< k N) (< 0 l) (= l i)) (or (< k N) (<= N (+ M 1)) (= l i)) (or (<= l M) (< k N) (= l i)) (or (<= j i) (< k N)) (or (= M l) (= l 0) (< k N) (< i (+ l 1))) (or (= (select A l) (select B l)) (= M l) (< k N) (not (= l 0)) (= l i)) (or (< i (+ j 1)) (< k N)) (or (<= (+ M 1) N) (< k N) (= l i))), 486263#(or (= (select A l) (select B l)) (< j M)), 486305#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 486303#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 486306#(and (or (= M l) (= l 0) (< k N) (<= (+ i 1) N) (= l j)) (or (<= l M) (< k N) (<= (+ i 1) N) (= l j)) (or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N) (= l j)))] [2022-03-15 22:21:33,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:21:33,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:21:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:21:33,608 INFO L87 Difference]: Start difference. First operand 2900 states and 12518 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:37,466 INFO L93 Difference]: Finished difference Result 3103 states and 13050 transitions. [2022-03-15 22:21:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 22:21:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:37,474 INFO L225 Difference]: With dead ends: 3103 [2022-03-15 22:21:37,474 INFO L226 Difference]: Without dead ends: 3092 [2022-03-15 22:21:37,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1072, Invalid=6068, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 22:21:37,475 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:37,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:21:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-03-15 22:21:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2902. [2022-03-15 22:21:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2901 states have (on average 4.318166149603585) internal successors, (12527), 2901 states have internal predecessors, (12527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 12527 transitions. [2022-03-15 22:21:37,527 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 12527 transitions. Word has length 17 [2022-03-15 22:21:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:37,527 INFO L470 AbstractCegarLoop]: Abstraction has 2902 states and 12527 transitions. [2022-03-15 22:21:37,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 12527 transitions. [2022-03-15 22:21:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:37,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:37,532 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:37,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-03-15 22:21:37,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-03-15 22:21:37,732 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1954838895, now seen corresponding path program 78 times [2022-03-15 22:21:37,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:37,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022999243] [2022-03-15 22:21:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:38,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:38,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022999243] [2022-03-15 22:21:38,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022999243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:38,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217941843] [2022-03-15 22:21:38,057 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:21:38,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:38,080 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:38,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 22:21:38,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:21:38,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:38,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:21:38,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:38,238 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 22:21:38,265 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 16 treesize of output 18 [2022-03-15 22:21:38,299 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:21:38,299 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:21:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:38,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:38,487 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:21:38,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:21:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:38,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217941843] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:38,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:38,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-03-15 22:21:38,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [941730256] [2022-03-15 22:21:38,651 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:38,652 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:38,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 50 transitions. [2022-03-15 22:21:38,654 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:39,435 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [495435#(or (= (select A l) (select B l)) (<= N i) (= l i)), 495436#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 495433#(or (= (select A l) (select B l)) (< k N)), 495438#(and (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1))) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (not (= l 0)) (= l j)) (or (not (= M i)) (= l 0) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (< 0 l) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j))), 495440#(and (or (= l 0) (<= l M) (< k N) (= l i)) (or (< k N) (<= 1 i)) (or (< k N) (<= N (+ M 1))) (or (= M l) (= l 0) (< k N) (< i (+ l 1))) (or (= j 0) (< k N))), 495434#(or (= (select A l) (select B l)) (< j M) (< k N)), 495439#(and (or (<= 2 i) (< (+ N 1) (+ M i)) (< k N) (<= M i)) (or (= (+ N l) (+ M i)) (not (= M i)) (< (+ N 1) (+ M i)) (= l 0) (<= l M) (< k N)) (or (< (+ N 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1))) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (= M l) (< (+ N 1) (+ M i)) (= l 0) (< k N) (<= 2 l)) (or (= j 0) (< k N)) (or (<= (+ N 1) (+ M i)) (< k N))), 495437#(and (or (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (<= (+ N j) (+ M i)) (<= j l)) (or (<= j i) (< k N) (<= (+ N j) (+ M i)) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (< 0 l) (<= (+ N j) (+ M i))) (or (= (select A l) (select B l)) (not (= M i)) (<= l M) (< k N) (<= (+ N j) (+ M i))) (or (< i (+ M 1)) (< k N) (<= N (+ M 1)) (<= (+ N j) (+ M i))))] [2022-03-15 22:21:39,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:21:39,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:21:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:21:39,435 INFO L87 Difference]: Start difference. First operand 2902 states and 12527 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:41,554 INFO L93 Difference]: Finished difference Result 3133 states and 13114 transitions. [2022-03-15 22:21:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:21:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:41,561 INFO L225 Difference]: With dead ends: 3133 [2022-03-15 22:21:41,561 INFO L226 Difference]: Without dead ends: 3124 [2022-03-15 22:21:41,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=454, Invalid=3086, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:21:41,562 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:41,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2022-03-15 22:21:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2912. [2022-03-15 22:21:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 4.316729646169701) internal successors, (12566), 2911 states have internal predecessors, (12566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 12566 transitions. [2022-03-15 22:21:41,604 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 12566 transitions. Word has length 17 [2022-03-15 22:21:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:41,604 INFO L470 AbstractCegarLoop]: Abstraction has 2912 states and 12566 transitions. [2022-03-15 22:21:41,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 12566 transitions. [2022-03-15 22:21:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:41,609 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:41,609 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:41,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-03-15 22:21:41,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-03-15 22:21:41,809 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1099532241, now seen corresponding path program 79 times [2022-03-15 22:21:41,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:41,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330197888] [2022-03-15 22:21:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:42,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:42,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330197888] [2022-03-15 22:21:42,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330197888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:42,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660690707] [2022-03-15 22:21:42,114 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:21:42,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:42,115 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:42,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 22:21:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:42,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:21:42,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:42,319 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 8 treesize of output 7 [2022-03-15 22:21:42,343 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 16 treesize of output 18 [2022-03-15 22:21:42,368 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 23 treesize of output 28 [2022-03-15 22:21:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:42,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:42,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:42,529 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:21:42,529 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 26 treesize of output 46 [2022-03-15 22:21:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:42,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660690707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:42,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:42,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:21:42,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807820500] [2022-03-15 22:21:42,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:42,709 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:42,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 55 transitions. [2022-03-15 22:21:42,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:43,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [504577#(or (= (select A l) (select B l)) (< k N)), 504582#(and (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1)) (= l j)) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (= l j) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (not (= l 0)) (= l j)) (or (not (= M i)) (= l 0) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (< 0 l) (= l j)) (or (not (= M i)) (= M l) (= l 0) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j))), 504584#(and (or (= l 0) (<= l M) (< k N) (= l i)) (or (< k N) (<= 1 i)) (or (< k N) (<= N (+ M 1))) (or (= M l) (= l 0) (< k N) (< i (+ l 1))) (or (= j 0) (< k N))), 504583#(and (or (= l (+ M i (* (- 1) N))) (<= 2 i) (< (+ N 1) (+ M i)) (< k N) (<= M i)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (< (+ N 1) (+ M i)) (= l 0) (<= l M) (< k N)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (< (+ N 1) (+ M i)) (= l 0) (< k N) (<= 2 l)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (<= 2 i) (< (+ N 1) (+ M i)) (not (= M l)) (< k N)) (or (= l (+ M i (* (- 1) N))) (< (+ N 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1))) (or (= j 0) (< k N)) (or (<= (+ N 1) (+ M i)) (< k N))), 504578#(or (= (select A l) (select B l)) (< j M) (< k N)), 504579#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 504580#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 504581#(and (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j)) (or (<= (+ 2 j) M) (= M l) (= l 0) (< k N) (= l j)))] [2022-03-15 22:21:43,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:21:43,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:21:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:21:43,493 INFO L87 Difference]: Start difference. First operand 2912 states and 12566 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:45,792 INFO L93 Difference]: Finished difference Result 3141 states and 13147 transitions. [2022-03-15 22:21:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 22:21:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:45,799 INFO L225 Difference]: With dead ends: 3141 [2022-03-15 22:21:45,799 INFO L226 Difference]: Without dead ends: 3125 [2022-03-15 22:21:45,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=463, Invalid=3197, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:21:45,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:45,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2022-03-15 22:21:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2912. [2022-03-15 22:21:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 4.318790793541738) internal successors, (12572), 2911 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 12572 transitions. [2022-03-15 22:21:45,841 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 12572 transitions. Word has length 17 [2022-03-15 22:21:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:45,841 INFO L470 AbstractCegarLoop]: Abstraction has 2912 states and 12572 transitions. [2022-03-15 22:21:45,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 12572 transitions. [2022-03-15 22:21:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:45,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:45,858 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:45,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-03-15 22:21:46,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:46,059 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -354829743, now seen corresponding path program 80 times [2022-03-15 22:21:46,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:46,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599912300] [2022-03-15 22:21:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:46,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:46,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599912300] [2022-03-15 22:21:46,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599912300] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:46,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850409752] [2022-03-15 22:21:46,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:46,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:46,341 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:46,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 22:21:46,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:46,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:46,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 22:21:46,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:46,503 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 8 treesize of output 7 [2022-03-15 22:21:46,537 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-03-15 22:21:46,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:21:46,575 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-03-15 22:21:46,576 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:21:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:46,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:46,771 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:21:46,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:21:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:46,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850409752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:46,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:46,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-03-15 22:21:46,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [509789696] [2022-03-15 22:21:46,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:46,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:46,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 65 transitions. [2022-03-15 22:21:46,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:47,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [513728#(and (or (<= (+ 2 j) M) (= (+ l (* (- 1) M)) 0) (= l 0) (< k N) (= l j)) (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j))), 513731#(and (or (= l 0) (<= l M) (< k N) (= l i)) (or (< k N) (<= 1 i)) (or (< k N) (<= N (+ M 1))) (or (= M l) (= l 0) (< k N) (< i (+ l 1))) (or (= j 0) (< k N))), 513722#(or (= (select A l) (select B l)) (< k N)), 513726#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 513725#(or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) M) (<= M (+ j 1)) (= l j)), 513723#(or (= (select A l) (select B l)) (< j M) (< k N)), 513724#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 513730#(and (or (= (+ N l) (+ M i)) (< (+ N 1) (+ M i)) (= l 0) (<= l M) (< k N)) (or (= l (+ M i (* (- 1) N))) (<= 2 i) (< (+ N 1) (+ M i)) (= l 0) (< k N) (not (= (+ l (* (- 1) M)) 0)) (<= M i)) (or (= j 0) (< k N)) (or (= l (+ M i (* (- 1) N))) (< (+ N 1) (+ M i)) (= (+ l (* (- 1) M)) 0) (= l 0) (< k N) (<= 2 l)) (or (<= (+ N 1) (+ M i)) (< k N)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (<= 2 i) (< (+ N 1) (+ M i)) (= l 0) (< k N)) (or (= l (+ M i (* (- 1) N))) (< (+ N 1) (+ M i)) (= l 0) (< i (+ M 1)) (< k N) (not (= (+ l (* (- 1) M)) 0)) (<= N (+ M 1)))), 513727#(or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) M) (< k N) (<= M (+ j 1)) (= l j)), 513729#(and (or (< k N) (<= 2 M)) (or (= (select A l) (select B l)) (= l 0) (< k N) (= (+ (- 1) M) l) (< 2 M)) (or (= j 0) (< k N)) (or (= (+ l (* (- 1) M)) 0) (= l 0) (< k N) (= (+ (- 1) M) l) (< 2 M)))] [2022-03-15 22:21:47,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:21:47,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:21:47,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:21:47,790 INFO L87 Difference]: Start difference. First operand 2912 states and 12572 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:50,543 INFO L93 Difference]: Finished difference Result 3204 states and 13367 transitions. [2022-03-15 22:21:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 22:21:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:50,550 INFO L225 Difference]: With dead ends: 3204 [2022-03-15 22:21:50,550 INFO L226 Difference]: Without dead ends: 3183 [2022-03-15 22:21:50,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=560, Invalid=3222, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:21:50,550 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:50,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2022-03-15 22:21:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2916. [2022-03-15 22:21:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2915 states have (on average 4.314579759862779) internal successors, (12577), 2915 states have internal predecessors, (12577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 12577 transitions. [2022-03-15 22:21:50,594 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 12577 transitions. Word has length 17 [2022-03-15 22:21:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:50,594 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 12577 transitions. [2022-03-15 22:21:50,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 12577 transitions. [2022-03-15 22:21:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:50,599 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:50,599 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:50,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:50,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:50,799 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash 671455599, now seen corresponding path program 81 times [2022-03-15 22:21:50,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:50,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013757980] [2022-03-15 22:21:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:51,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:51,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013757980] [2022-03-15 22:21:51,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013757980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:51,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555144904] [2022-03-15 22:21:51,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:51,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:51,201 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:51,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 22:21:51,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:21:51,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:51,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:21:51,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:51,342 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 22:21:51,379 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-03-15 22:21:51,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2022-03-15 22:21:51,470 INFO L353 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2022-03-15 22:21:51,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2022-03-15 22:21:51,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:51,560 INFO L353 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-03-15 22:21:51,560 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2022-03-15 22:21:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:51,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:51,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:51,973 INFO L353 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2022-03-15 22:21:51,973 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 29 treesize of output 49 [2022-03-15 22:21:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:52,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555144904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:52,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:52,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 22:21:52,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471658670] [2022-03-15 22:21:52,099 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:52,100 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:52,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 22:21:52,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:52,565 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [522948#(or (= (select A l) (select B l)) (< k N)), 522951#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i)), 522950#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 522954#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 522955#(and (or (= l 0) (<= l M) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (<= j 1) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= l 0) (not (<= l 0)) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= l 0)) (<= (+ 2 i) N) (= l i)) (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ 2 i) N) (= l i))), 522953#(or (= (select A l) (select B l)) (< j M) (< k N)), 522952#(or (= (select A l) (select B l)) (< j M)), 522949#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i))] [2022-03-15 22:21:52,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:21:52,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:21:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:21:52,565 INFO L87 Difference]: Start difference. First operand 2916 states and 12577 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:54,325 INFO L93 Difference]: Finished difference Result 3107 states and 13082 transitions. [2022-03-15 22:21:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:21:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:54,332 INFO L225 Difference]: With dead ends: 3107 [2022-03-15 22:21:54,333 INFO L226 Difference]: Without dead ends: 3100 [2022-03-15 22:21:54,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=660, Invalid=3372, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:21:54,333 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:54,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-03-15 22:21:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2920. [2022-03-15 22:21:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 4.31380609797876) internal successors, (12592), 2919 states have internal predecessors, (12592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 12592 transitions. [2022-03-15 22:21:54,376 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 12592 transitions. Word has length 17 [2022-03-15 22:21:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:54,376 INFO L470 AbstractCegarLoop]: Abstraction has 2920 states and 12592 transitions. [2022-03-15 22:21:54,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 12592 transitions. [2022-03-15 22:21:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:54,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:54,381 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:54,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-03-15 22:21:54,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2022-03-15 22:21:54,581 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1526762253, now seen corresponding path program 82 times [2022-03-15 22:21:54,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:54,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453497240] [2022-03-15 22:21:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:54,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:54,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453497240] [2022-03-15 22:21:54,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453497240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:54,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461218571] [2022-03-15 22:21:54,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:54,978 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:54,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 22:21:55,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:55,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:55,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:21:55,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:55,163 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 8 treesize of output 7 [2022-03-15 22:21:55,204 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:21:55,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:21:55,275 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-03-15 22:21:55,275 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:21:55,321 INFO L353 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2022-03-15 22:21:55,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:21:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:55,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:55,614 INFO L353 Elim1Store]: treesize reduction 30, result has 66.3 percent of original size [2022-03-15 22:21:55,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 78 [2022-03-15 22:21:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:55,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461218571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:55,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:55,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-03-15 22:21:55,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639905007] [2022-03-15 22:21:55,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:55,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:55,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 49 transitions. [2022-03-15 22:21:55,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:56,252 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [532085#(or (= (select A l) (select B l)) (< k N)), 532087#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 532090#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 532091#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N) (= l j)) (or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N) (< 0 l) (= l j)) (or (= j 0) (< k N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N) (= l j))), 532089#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (= l j)), 532088#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 532086#(or (= (select A l) (select B l)) (< j M) (< k N)), 532047#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:21:56,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:21:56,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:21:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:21:56,253 INFO L87 Difference]: Start difference. First operand 2920 states and 12592 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:59,084 INFO L93 Difference]: Finished difference Result 3085 states and 12971 transitions. [2022-03-15 22:21:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:21:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:59,091 INFO L225 Difference]: With dead ends: 3085 [2022-03-15 22:21:59,091 INFO L226 Difference]: Without dead ends: 3078 [2022-03-15 22:21:59,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=857, Invalid=4995, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:21:59,092 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:59,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:21:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2022-03-15 22:21:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2924. [2022-03-15 22:21:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2923 states have (on average 4.3130345535408825) internal successors, (12607), 2923 states have internal predecessors, (12607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 12607 transitions. [2022-03-15 22:21:59,133 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 12607 transitions. Word has length 17 [2022-03-15 22:21:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:59,133 INFO L470 AbstractCegarLoop]: Abstraction has 2924 states and 12607 transitions. [2022-03-15 22:21:59,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 12607 transitions. [2022-03-15 22:21:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:59,138 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:59,138 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:59,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:59,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 22:21:59,338 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1485178539, now seen corresponding path program 83 times [2022-03-15 22:21:59,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:59,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916104146] [2022-03-15 22:21:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:21:59,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:59,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916104146] [2022-03-15 22:21:59,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916104146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:59,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239490796] [2022-03-15 22:21:59,780 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:59,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:59,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:59,781 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:21:59,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 22:21:59,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:21:59,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:59,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:21:59,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:59,985 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 8 treesize of output 7 [2022-03-15 22:22:00,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:00,012 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 20 treesize of output 22 [2022-03-15 22:22:00,045 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 23 treesize of output 28 [2022-03-15 22:22:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:00,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:00,219 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:22:00,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:22:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:00,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239490796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:00,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:00,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:22:00,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239045610] [2022-03-15 22:22:00,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:00,397 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:00,399 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 22:22:00,399 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:01,232 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [541236#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 541232#(or (= (select A l) (select B l)) (< k N)), 541230#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i)), 541234#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 541237#(and (or (= l 0) (<= l M) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (<= j 1) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= l 0) (not (<= l 0)) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= l 0)) (<= (+ 2 i) N) (= l i)) (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ 2 i) N) (= l i))), 541238#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)), 541192#(or (= (select A l) (select B l)) (< j M)), 541231#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l i) (= (+ i 1) l)), 541233#(or (= (select A l) (select B l)) (< j M) (< k N)), 541235#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i)), 541239#(and (or (< i (+ M 1)) (< k N)) (or (<= (+ 3 i) N) (= l 0) (<= l M) (< k N) (= (+ i 1) l)) (or (<= (+ 3 i) N) (= l 0) (not (<= l 0)) (< k N) (< M (+ l 1))) (or (<= (+ 3 i) N) (= l 0) (<= j 1) (< k N) (< M (+ l 1))) (or (<= (+ 2 M) N) (< k N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (not (= l 0)) (= l i) (= (+ i 1) l)))] [2022-03-15 22:22:01,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:22:01,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:22:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:22:01,233 INFO L87 Difference]: Start difference. First operand 2924 states and 12607 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:03,776 INFO L93 Difference]: Finished difference Result 3488 states and 14716 transitions. [2022-03-15 22:22:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:22:03,777 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:22:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:03,785 INFO L225 Difference]: With dead ends: 3488 [2022-03-15 22:22:03,785 INFO L226 Difference]: Without dead ends: 3469 [2022-03-15 22:22:03,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=788, Invalid=4042, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:22:03,785 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:03,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2022-03-15 22:22:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 2931. [2022-03-15 22:22:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2930 states have (on average 4.315699658703072) internal successors, (12645), 2930 states have internal predecessors, (12645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 12645 transitions. [2022-03-15 22:22:03,830 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 12645 transitions. Word has length 17 [2022-03-15 22:22:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:03,831 INFO L470 AbstractCegarLoop]: Abstraction has 2931 states and 12645 transitions. [2022-03-15 22:22:03,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 12645 transitions. [2022-03-15 22:22:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:22:03,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:03,835 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:03,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:04,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-03-15 22:22:04,036 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2065086259, now seen corresponding path program 84 times [2022-03-15 22:22:04,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:04,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677515462] [2022-03-15 22:22:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:04,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:04,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677515462] [2022-03-15 22:22:04,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677515462] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:04,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329156354] [2022-03-15 22:22:04,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:04,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:04,447 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:04,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 22:22:04,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:22:04,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:04,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:22:04,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:04,597 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 8 treesize of output 7 [2022-03-15 22:22:04,631 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:22:04,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:22:04,674 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-03-15 22:22:04,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:22:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:04,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:04,935 INFO L353 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-03-15 22:22:04,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 48 [2022-03-15 22:22:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:05,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329156354] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:05,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:05,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2022-03-15 22:22:05,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729340295] [2022-03-15 22:22:05,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:05,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:05,079 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 46 transitions. [2022-03-15 22:22:05,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:05,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [550771#(or (= (select A l) (select B l)) (< j M)), 550777#(and (or (= l 0) (<= l M) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (<= j 1) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= l 0) (not (<= l 0)) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= l 0)) (<= (+ 2 i) N) (= l i)) (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ 2 i) N) (= l i))), 550774#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 550770#(or (= (select A l) (select B l)) (< k N)), 550776#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 550775#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i)), 550778#(and (or (= j 0) (< k N)) (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= M 0) (<= (+ 2 i) N) (= l i)) (or (= l 0) (< k N) (<= M 0) (<= (+ 2 i) N) (< 0 l) (= l i)) (or (<= l M) (< k N) (<= M 0) (<= (+ 2 i) N) (= l i))), 550772#(or (= (select A l) (select B l)) (< j M) (< k N)), 550773#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i))] [2022-03-15 22:22:05,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:22:05,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:22:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:22:05,625 INFO L87 Difference]: Start difference. First operand 2931 states and 12645 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:07,473 INFO L93 Difference]: Finished difference Result 3228 states and 13552 transitions. [2022-03-15 22:22:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:22:07,473 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:22:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:07,480 INFO L225 Difference]: With dead ends: 3228 [2022-03-15 22:22:07,480 INFO L226 Difference]: Without dead ends: 3217 [2022-03-15 22:22:07,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=633, Invalid=2789, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:22:07,481 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:07,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2022-03-15 22:22:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2936. [2022-03-15 22:22:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 4.3151618398637135) internal successors, (12665), 2935 states have internal predecessors, (12665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 12665 transitions. [2022-03-15 22:22:07,524 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 12665 transitions. Word has length 17 [2022-03-15 22:22:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:07,524 INFO L470 AbstractCegarLoop]: Abstraction has 2936 states and 12665 transitions. [2022-03-15 22:22:07,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 12665 transitions. [2022-03-15 22:22:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:22:07,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:07,529 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:07,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-03-15 22:22:07,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-03-15 22:22:07,730 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1209779605, now seen corresponding path program 85 times [2022-03-15 22:22:07,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:07,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246001174] [2022-03-15 22:22:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:08,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:08,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246001174] [2022-03-15 22:22:08,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246001174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:08,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661584636] [2022-03-15 22:22:08,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:08,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:08,164 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:08,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 22:22:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:08,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:22:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:08,383 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 22:22:08,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:08,406 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 22:22:08,437 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 23 treesize of output 28 [2022-03-15 22:22:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:08,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:08,616 INFO L353 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2022-03-15 22:22:08,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2022-03-15 22:22:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:08,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661584636] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:08,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:08,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:22:08,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744745391] [2022-03-15 22:22:08,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:08,800 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:08,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 22:22:08,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:09,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [560060#(or (= (select A l) (select B l)) (< k N)), 560063#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 560062#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 560022#(or (= (select A l) (select B l)) (< j M)), 560061#(or (= (select A l) (select B l)) (< j M) (< k N)), 560065#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 560067#(and (or (= (select A l) (select B l)) (<= N i) (not (= M l)) (= l 0) (< k N) (<= (+ 2 i) N) (= l i)) (or (<= N i) (= l 0) (< k N) (<= (+ 2 i) N) (< 0 l) (= l i) (< M (+ l 1))) (or (<= N i) (= l 0) (<= l M) (< k N) (<= (+ 2 i) N) (= l i)) (or (= j 0) (< k N))), 560066#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N) (= l j)) (or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N) (< 0 l) (= l j)) (or (= j 0) (< k N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N) (= l j))), 560064#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (= l j))] [2022-03-15 22:22:09,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:22:09,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:22:09,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:22:09,397 INFO L87 Difference]: Start difference. First operand 2936 states and 12665 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:14,044 INFO L93 Difference]: Finished difference Result 3127 states and 13107 transitions. [2022-03-15 22:22:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 22:22:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:22:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:14,050 INFO L225 Difference]: With dead ends: 3127 [2022-03-15 22:22:14,050 INFO L226 Difference]: Without dead ends: 3120 [2022-03-15 22:22:14,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1032, Invalid=6800, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:22:14,051 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:14,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:22:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-03-15 22:22:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2939. [2022-03-15 22:22:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2938 states have (on average 4.314159292035399) internal successors, (12675), 2938 states have internal predecessors, (12675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 12675 transitions. [2022-03-15 22:22:14,091 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 12675 transitions. Word has length 17 [2022-03-15 22:22:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:14,091 INFO L470 AbstractCegarLoop]: Abstraction has 2939 states and 12675 transitions. [2022-03-15 22:22:14,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 12675 transitions. [2022-03-15 22:22:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:22:14,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:14,096 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:14,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:14,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:14,297 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 940785903, now seen corresponding path program 86 times [2022-03-15 22:22:14,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:14,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622901735] [2022-03-15 22:22:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:14,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:14,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622901735] [2022-03-15 22:22:14,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622901735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:14,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195725801] [2022-03-15 22:22:14,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:14,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:14,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:14,612 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:14,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 22:22:14,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:14,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:14,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:22:14,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:14,817 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 22:22:14,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:14,843 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 22:22:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:14,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:14,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:14,872 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 31 treesize of output 36 [2022-03-15 22:22:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:14,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:15,074 INFO L353 Elim1Store]: treesize reduction 47, result has 23.0 percent of original size [2022-03-15 22:22:15,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 22:22:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:15,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195725801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:15,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:15,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:22:15,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82133715] [2022-03-15 22:22:15,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:15,239 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:15,242 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 58 transitions. [2022-03-15 22:22:15,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:16,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [569312#(and (or (= l 0) (<= l M) (< k N) (<= (+ 2 i) N) (= l i)) (or (= l 0) (<= j 1) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= l 0) (not (<= l 0)) (< k N) (<= (+ 2 i) N) (= l i) (< M (+ l 1))) (or (= (select A l) (select B l)) (< k N) (not (= l 0)) (<= (+ 2 i) N) (= l i)) (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ 2 i) N) (= l i))), 569311#(and (or (= (select A l) (select B l)) (not (= M l)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= l M) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (not (<= l 0)) (< k N) (<= (+ i 1) N)) (or (= (select A l) (select B l)) (<= j 1) (< k N) (<= (+ i 1) N))), 569309#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (= l (+ 2 i)) (= l i) (= (+ i 1) l)), 569310#(or (= (select A l) (select B l)) (<= N (+ 2 i)) (<= (+ i 4) N) (< k N) (= l (+ 2 i)) (= l i) (= (+ i 1) l)), 569308#(or (= (select A l) (select B l)) (< j M) (< k N)), 569303#(or (= (select A l) (select B l)) (not (< i N)) (<= (+ 2 i) N) (= l i)), 569314#(and (or (<= 1 M) (< k N) (= (+ (- 1) N) l) (< 3 N)) (or (< k N) (= i 0)) (or (<= (+ 2 M) N) (< k N) (= (+ (- 1) N) l) (< 3 N)) (or (= M l) (= l 0) (< k N) (= (+ (- 1) N) l) (< 3 N)) (or (<= 3 N) (< k N))), 569306#(or (= (select A l) (select B l)) (not (< i N)) (< k N) (<= (+ 2 i) N) (= l i)), 569313#(and (or (<= (+ 3 i) N) (= l 0) (<= j 1) (< k N) (= (+ i 1) l) (< M (+ l 1))) (or (<= (+ 3 i) N) (= l 0) (not (<= l 0)) (< k N) (= (+ i 1) l) (< M (+ l 1))) (or (<= (+ 3 i) N) (= l 0) (<= l M) (< k N) (= (+ i 1) l)) (or (< k N) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (= M i) (< k N) (= (+ l 1) N)) (or (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (not (= l 0)) (= l i) (= (+ i 1) l))), 569302#(or (= (select A l) (select B l)) (< k N)), 569305#(or (= (select A l) (select B l)) (< k N) (<= (+ i 1) N)), 569307#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (< k N) (= l i) (= (+ i 1) l)), 569264#(or (= (select A l) (select B l)) (< j M)), 569304#(or (<= N (+ i 1)) (<= (+ 3 i) N) (= (select A l) (select B l)) (= l i) (= (+ i 1) l))] [2022-03-15 22:22:16,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:22:16,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:22:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:22:16,292 INFO L87 Difference]: Start difference. First operand 2939 states and 12675 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:18,660 INFO L93 Difference]: Finished difference Result 3966 states and 16745 transitions. [2022-03-15 22:22:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:22:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:22:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:18,669 INFO L225 Difference]: With dead ends: 3966 [2022-03-15 22:22:18,669 INFO L226 Difference]: Without dead ends: 3931 [2022-03-15 22:22:18,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=870, Invalid=4242, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:22:18,669 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:18,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2022-03-15 22:22:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2822. [2022-03-15 22:22:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 4.317617866004963) internal successors, (12180), 2821 states have internal predecessors, (12180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 12180 transitions. [2022-03-15 22:22:18,717 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 12180 transitions. Word has length 17 [2022-03-15 22:22:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:18,717 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 12180 transitions. [2022-03-15 22:22:18,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 12180 transitions. [2022-03-15 22:22:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:18,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:18,722 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:18,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:18,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:18,922 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1734838353, now seen corresponding path program 87 times [2022-03-15 22:22:18,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:18,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108543562] [2022-03-15 22:22:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:18,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:18,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108543562] [2022-03-15 22:22:18,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108543562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:18,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609110948] [2022-03-15 22:22:18,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:18,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:18,973 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:18,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 22:22:19,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:22:19,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:19,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:19,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:19,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:19,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609110948] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:19,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:19,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 22:22:19,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090575363] [2022-03-15 22:22:19,203 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:19,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:19,206 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 55 transitions. [2022-03-15 22:22:19,206 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:19,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [579110#(< k N), 579082#(or (<= k i) (< j M)), 579112#(or (<= N i) (< j M)), 579113#(or (<= N i) (<= k i)), 579107#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ j 1) i))), 579108#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= j i))), 579109#(< j M), 579111#(or (< j M) (< k N))] [2022-03-15 22:22:19,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:22:19,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:22:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:22:19,388 INFO L87 Difference]: Start difference. First operand 2822 states and 12180 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:19,992 INFO L93 Difference]: Finished difference Result 3594 states and 14554 transitions. [2022-03-15 22:22:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:22:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:20,000 INFO L225 Difference]: With dead ends: 3594 [2022-03-15 22:22:20,000 INFO L226 Difference]: Without dead ends: 3590 [2022-03-15 22:22:20,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=753, Invalid=2553, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:22:20,001 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:20,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2022-03-15 22:22:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 2891. [2022-03-15 22:22:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2890 states have (on average 4.356401384083045) internal successors, (12590), 2890 states have internal predecessors, (12590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 12590 transitions. [2022-03-15 22:22:20,053 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 12590 transitions. Word has length 18 [2022-03-15 22:22:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:20,053 INFO L470 AbstractCegarLoop]: Abstraction has 2891 states and 12590 transitions. [2022-03-15 22:22:20,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 12590 transitions. [2022-03-15 22:22:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:20,058 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:20,058 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:20,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:20,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-03-15 22:22:20,259 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -967224431, now seen corresponding path program 88 times [2022-03-15 22:22:20,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:20,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157427896] [2022-03-15 22:22:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:20,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:20,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157427896] [2022-03-15 22:22:20,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157427896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:20,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728906896] [2022-03-15 22:22:20,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:20,311 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:20,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 22:22:20,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:20,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:20,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:20,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:20,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:20,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728906896] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:20,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:20,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 22 [2022-03-15 22:22:20,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153614858] [2022-03-15 22:22:20,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:20,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:20,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 53 transitions. [2022-03-15 22:22:20,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:20,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [588683#(or (< k N) (<= (+ N j) (+ M i))), 588679#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= j i))), 588682#(or (< k N) (<= (+ j 1) M)), 588681#(or (<= N i) (< k N)), 588678#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ j 1) i))), 588677#(< k N), 588680#(<= N i)] [2022-03-15 22:22:20,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:22:20,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:22:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:20,814 INFO L87 Difference]: Start difference. First operand 2891 states and 12590 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:21,382 INFO L93 Difference]: Finished difference Result 3809 states and 15463 transitions. [2022-03-15 22:22:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:22:21,382 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:21,391 INFO L225 Difference]: With dead ends: 3809 [2022-03-15 22:22:21,391 INFO L226 Difference]: Without dead ends: 3805 [2022-03-15 22:22:21,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=679, Invalid=2861, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:22:21,392 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:21,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2022-03-15 22:22:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3035. [2022-03-15 22:22:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3034 states have (on average 4.3899143045484506) internal successors, (13319), 3034 states have internal predecessors, (13319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 13319 transitions. [2022-03-15 22:22:21,458 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 13319 transitions. Word has length 18 [2022-03-15 22:22:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:21,458 INFO L470 AbstractCegarLoop]: Abstraction has 3035 states and 13319 transitions. [2022-03-15 22:22:21,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 13319 transitions. [2022-03-15 22:22:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:21,463 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:21,464 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:21,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-03-15 22:22:21,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:21,664 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -111917777, now seen corresponding path program 89 times [2022-03-15 22:22:21,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:21,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318039779] [2022-03-15 22:22:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:21,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:21,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318039779] [2022-03-15 22:22:21,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318039779] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:21,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69606242] [2022-03-15 22:22:21,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:21,726 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:21,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 22:22:21,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:22:21,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:21,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:21,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:21,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:21,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69606242] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:21,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:21,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-03-15 22:22:21,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987672288] [2022-03-15 22:22:21,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:21,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:21,978 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 22:22:21,978 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:22,228 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [598748#(or (< k N) (<= (+ j 1) M)), 598747#(or (<= (+ 2 j) M) (<= M j)), 598746#(< k N), 598749#(or (<= (+ 2 j) M) (< k N) (<= M j)), 598752#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= j i))), 598751#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ j 1) i))), 598750#(or (<= (+ 2 j) M) (< k N))] [2022-03-15 22:22:22,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:22:22,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:22:22,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:22:22,229 INFO L87 Difference]: Start difference. First operand 3035 states and 13319 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:23,094 INFO L93 Difference]: Finished difference Result 3632 states and 14938 transitions. [2022-03-15 22:22:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:22:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:23,102 INFO L225 Difference]: With dead ends: 3632 [2022-03-15 22:22:23,102 INFO L226 Difference]: Without dead ends: 3629 [2022-03-15 22:22:23,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=755, Invalid=3535, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:22:23,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:23,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2022-03-15 22:22:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3028. [2022-03-15 22:22:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 3027 states have (on average 4.3858605880409645) internal successors, (13276), 3027 states have internal predecessors, (13276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 13276 transitions. [2022-03-15 22:22:23,156 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 13276 transitions. Word has length 18 [2022-03-15 22:22:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:23,156 INFO L470 AbstractCegarLoop]: Abstraction has 3028 states and 13276 transitions. [2022-03-15 22:22:23,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 13276 transitions. [2022-03-15 22:22:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:23,161 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:23,161 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:23,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:23,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:23,362 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash 769383439, now seen corresponding path program 90 times [2022-03-15 22:22:23,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:23,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282217149] [2022-03-15 22:22:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:23,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:23,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282217149] [2022-03-15 22:22:23,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282217149] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:23,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12259111] [2022-03-15 22:22:23,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:23,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:23,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:23,421 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:23,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 22:22:23,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:22:23,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:23,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:23,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:23,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:23,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12259111] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:23,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:23,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-15 22:22:23,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769288703] [2022-03-15 22:22:23,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:23,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:23,633 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2022-03-15 22:22:23,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:23,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [608641#(or (<= N i) (< j M)), 608639#(or (<= N (+ i 1)) (< k N)), 608644#(or (< j M) (< k N)), 608638#(or (<= N i) (< k N)), 608646#(or (<= N (+ i 1)) (< j M) (< k N)), 608645#(or (<= N i) (< j M) (< k N)), 608642#(or (<= N (+ i 1)) (< j M)), 608643#(or (<= N (+ 2 i)) (< j M)), 608649#(or (< (+ 2 j) M) (<= k (+ i 1)) (<= M (+ j 1))), 608647#(or (< j M) (<= k (+ 2 i))), 608650#(or (<= N i) (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 608637#(< k N), 608648#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 608640#(< j M), 608618#(or (< j M) (<= k (+ i 1))), 608651#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i)))] [2022-03-15 22:22:23,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:22:23,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:22:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:22:23,976 INFO L87 Difference]: Start difference. First operand 3028 states and 13276 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:25,747 INFO L93 Difference]: Finished difference Result 5289 states and 20428 transitions. [2022-03-15 22:22:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 22:22:25,748 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:25,758 INFO L225 Difference]: With dead ends: 5289 [2022-03-15 22:22:25,759 INFO L226 Difference]: Without dead ends: 5280 [2022-03-15 22:22:25,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2461, Invalid=9311, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 22:22:25,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:25,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2022-03-15 22:22:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 3345. [2022-03-15 22:22:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 3344 states have (on average 4.4063995215311005) internal successors, (14735), 3344 states have internal predecessors, (14735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 14735 transitions. [2022-03-15 22:22:25,829 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 14735 transitions. Word has length 18 [2022-03-15 22:22:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:25,829 INFO L470 AbstractCegarLoop]: Abstraction has 3345 states and 14735 transitions. [2022-03-15 22:22:25,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 14735 transitions. [2022-03-15 22:22:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:25,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:25,835 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:25,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:26,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-03-15 22:22:26,035 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1254324643, now seen corresponding path program 91 times [2022-03-15 22:22:26,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:26,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931829726] [2022-03-15 22:22:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:26,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:26,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931829726] [2022-03-15 22:22:26,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931829726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:26,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101906837] [2022-03-15 22:22:26,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:26,092 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:26,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 22:22:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:26,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:26,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:26,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:26,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101906837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:26,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:26,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:22:26,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758299838] [2022-03-15 22:22:26,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:26,272 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:26,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 64 transitions. [2022-03-15 22:22:26,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:26,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [620900#(< j M), 620909#(or (< (+ j 1) M) (<= N i) (<= k (+ i 1)) (<= M j)), 620903#(< k N), 620906#(or (<= N i) (< j M) (< k N)), 620907#(or (< j M) (<= k (+ i 1))), 620910#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 620902#(or (<= N (+ i 1)) (< j M)), 620901#(or (<= N i) (< j M)), 620905#(or (<= N i) (< k N)), 620885#(or (<= k i) (< j M)), 620908#(or (< (+ j 1) M) (<= k i) (<= M j)), 620904#(or (< j M) (< k N))] [2022-03-15 22:22:26,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:22:26,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:26,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:22:26,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:22:26,528 INFO L87 Difference]: Start difference. First operand 3345 states and 14735 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:27,415 INFO L93 Difference]: Finished difference Result 4766 states and 19063 transitions. [2022-03-15 22:22:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:22:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:27,426 INFO L225 Difference]: With dead ends: 4766 [2022-03-15 22:22:27,427 INFO L226 Difference]: Without dead ends: 4763 [2022-03-15 22:22:27,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1050, Invalid=3506, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:22:27,427 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:27,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2022-03-15 22:22:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 3386. [2022-03-15 22:22:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 4.401477104874446) internal successors, (14899), 3385 states have internal predecessors, (14899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 14899 transitions. [2022-03-15 22:22:27,511 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 14899 transitions. Word has length 18 [2022-03-15 22:22:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:27,511 INFO L470 AbstractCegarLoop]: Abstraction has 3386 states and 14899 transitions. [2022-03-15 22:22:27,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 14899 transitions. [2022-03-15 22:22:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:27,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:27,517 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:27,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:27,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:27,717 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1189255547, now seen corresponding path program 92 times [2022-03-15 22:22:27,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:27,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273368608] [2022-03-15 22:22:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:27,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:27,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273368608] [2022-03-15 22:22:27,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273368608] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:27,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603721070] [2022-03-15 22:22:27,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:27,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:27,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:27,774 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:27,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 22:22:27,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:27,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:27,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:27,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:27,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:27,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603721070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:27,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:27,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15 [2022-03-15 22:22:27,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713365595] [2022-03-15 22:22:27,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:27,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:27,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2022-03-15 22:22:27,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:28,310 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [632663#(or (<= N (+ i 1)) (< j M) (< k N)), 632655#(or (<= N i) (< j M)), 632667#(or (< (+ j 1) M) (<= N i) (<= k (+ i 1)) (<= M j)), 632659#(or (<= N i) (< k N)), 632666#(or (< (+ j 1) M) (<= k i) (<= M j)), 632657#(or (<= N (+ 2 i)) (< j M)), 632660#(or (<= N (+ i 1)) (< k N)), 632658#(< k N), 632656#(or (<= N (+ i 1)) (< j M)), 632661#(or (< j M) (< k N)), 632664#(or (< j M) (<= k (+ 2 i))), 632639#(or (<= k i) (< j M)), 632665#(or (< j M) (<= k (+ i 1))), 632654#(< j M), 632662#(or (<= N i) (< j M) (< k N)), 632668#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i)))] [2022-03-15 22:22:28,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:22:28,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:22:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:22:28,311 INFO L87 Difference]: Start difference. First operand 3386 states and 14899 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:29,593 INFO L93 Difference]: Finished difference Result 5402 states and 21404 transitions. [2022-03-15 22:22:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 22:22:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:29,606 INFO L225 Difference]: With dead ends: 5402 [2022-03-15 22:22:29,606 INFO L226 Difference]: Without dead ends: 5391 [2022-03-15 22:22:29,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1758, Invalid=6252, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 22:22:29,607 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:29,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5391 states. [2022-03-15 22:22:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5391 to 3761. [2022-03-15 22:22:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3761 states, 3760 states have (on average 4.427925531914894) internal successors, (16649), 3760 states have internal predecessors, (16649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 16649 transitions. [2022-03-15 22:22:29,693 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 16649 transitions. Word has length 18 [2022-03-15 22:22:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:29,693 INFO L470 AbstractCegarLoop]: Abstraction has 3761 states and 16649 transitions. [2022-03-15 22:22:29,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 16649 transitions. [2022-03-15 22:22:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:29,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:29,700 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:29,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-03-15 22:22:29,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:29,901 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 666058221, now seen corresponding path program 29 times [2022-03-15 22:22:29,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:29,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985584478] [2022-03-15 22:22:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:29,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:29,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985584478] [2022-03-15 22:22:29,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985584478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:29,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940090475] [2022-03-15 22:22:29,958 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:29,959 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:29,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 22:22:30,035 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:22:30,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:30,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:30,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:30,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:30,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940090475] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:30,131 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:30,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 22:22:30,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [299876334] [2022-03-15 22:22:30,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:30,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:30,135 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2022-03-15 22:22:30,135 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:30,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [645835#(or (<= N i) (<= k i)), 645816#(or (< j M) (<= (+ k 1) i)), 645832#(or (<= N i) (< k N)), 645829#(or (<= N i) (< j M)), 645828#(< k N), 645834#(or (< j M) (<= k (+ i 1))), 645823#(or (<= k i) (< j M)), 645831#(or (< j M) (< k N)), 645827#(< j M), 645837#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 645833#(or (<= N i) (< j M) (< k N)), 645836#(or (<= N i) (<= k i) (< j M)), 645830#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:22:30,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:22:30,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:22:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:22:30,405 INFO L87 Difference]: Start difference. First operand 3761 states and 16649 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:30,872 INFO L93 Difference]: Finished difference Result 4210 states and 17951 transitions. [2022-03-15 22:22:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 22:22:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:30,882 INFO L225 Difference]: With dead ends: 4210 [2022-03-15 22:22:30,882 INFO L226 Difference]: Without dead ends: 4208 [2022-03-15 22:22:30,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=529, Invalid=1727, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:22:30,882 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:30,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2022-03-15 22:22:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3788. [2022-03-15 22:22:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3787 states have (on average 4.419593345656192) internal successors, (16737), 3787 states have internal predecessors, (16737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 16737 transitions. [2022-03-15 22:22:30,946 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 16737 transitions. Word has length 18 [2022-03-15 22:22:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:30,946 INFO L470 AbstractCegarLoop]: Abstraction has 3788 states and 16737 transitions. [2022-03-15 22:22:30,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 16737 transitions. [2022-03-15 22:22:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:30,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:30,953 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:30,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2022-03-15 22:22:31,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-03-15 22:22:31,153 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1777521969, now seen corresponding path program 30 times [2022-03-15 22:22:31,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:31,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840898898] [2022-03-15 22:22:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:31,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:31,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840898898] [2022-03-15 22:22:31,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840898898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:31,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828044927] [2022-03-15 22:22:31,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:31,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:31,266 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:31,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 22:22:31,339 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:22:31,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:31,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:31,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:31,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:31,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828044927] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:31,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:31,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-03-15 22:22:31,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3417225] [2022-03-15 22:22:31,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:31,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:31,451 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 74 transitions. [2022-03-15 22:22:31,451 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:31,811 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [657799#(or (<= N (+ 2 i)) (< j M)), 657798#(or (<= N (+ i 1)) (< j M) (< k N)), 657800#(or (< j M) (<= k (+ 2 i))), 657778#(or (< j M) (<= (+ k 1) i)), 657802#(or (<= N i) (<= k i) (< j M)), 657790#(< k N), 657801#(or (< j M) (<= k (+ i 1))), 657803#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 657794#(or (<= N i) (< k N)), 657792#(or (<= N i) (< j M)), 657793#(or (<= N (+ i 1)) (< j M)), 657797#(or (<= N i) (< j M) (< k N)), 657796#(or (< j M) (< k N)), 657785#(or (<= k i) (< j M)), 657791#(or (<= N i) (<= k i)), 657789#(< j M), 657795#(or (<= N (+ i 1)) (< k N))] [2022-03-15 22:22:31,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:22:31,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:22:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:31,812 INFO L87 Difference]: Start difference. First operand 3788 states and 16737 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:32,361 INFO L93 Difference]: Finished difference Result 4438 states and 18776 transitions. [2022-03-15 22:22:32,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:22:32,361 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:32,371 INFO L225 Difference]: With dead ends: 4438 [2022-03-15 22:22:32,371 INFO L226 Difference]: Without dead ends: 4431 [2022-03-15 22:22:32,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=772, Invalid=2534, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:22:32,372 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:32,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2022-03-15 22:22:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 3744. [2022-03-15 22:22:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 4.43494523109805) internal successors, (16600), 3743 states have internal predecessors, (16600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 16600 transitions. [2022-03-15 22:22:32,436 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 16600 transitions. Word has length 18 [2022-03-15 22:22:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:32,436 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 16600 transitions. [2022-03-15 22:22:32,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 16600 transitions. [2022-03-15 22:22:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:32,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:32,443 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:32,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:32,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:32,644 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 579855557, now seen corresponding path program 93 times [2022-03-15 22:22:32,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:32,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969119136] [2022-03-15 22:22:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:32,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:32,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969119136] [2022-03-15 22:22:32,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969119136] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:32,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478506582] [2022-03-15 22:22:32,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:32,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:32,704 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 22:22:32,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:22:32,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:32,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:32,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:32,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:32,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478506582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:32,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:32,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2022-03-15 22:22:32,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591983065] [2022-03-15 22:22:32,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:32,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:33,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 65 transitions. [2022-03-15 22:22:33,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:33,279 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [669912#(or (<= N i) (< k N)), 669916#(or (<= N (+ 2 i)) (< k N)), 669920#(or (<= (+ N j) (+ 2 M i)) (< k N)), 669917#(or (< k N) (<= (+ j 1) M)), 669911#(<= N i), 669913#(<= N (+ i 1)), 669914#(or (<= N (+ i 1)) (< k N)), 669910#(< k N), 669915#(<= N (+ 2 i)), 669919#(or (< k N) (<= (+ N j) (+ M i 1))), 669921#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 669918#(or (< k N) (<= (+ N j) (+ M i)))] [2022-03-15 22:22:33,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:22:33,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:22:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:22:33,280 INFO L87 Difference]: Start difference. First operand 3744 states and 16600 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:33,897 INFO L93 Difference]: Finished difference Result 5009 states and 20787 transitions. [2022-03-15 22:22:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:22:33,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:33,909 INFO L225 Difference]: With dead ends: 5009 [2022-03-15 22:22:33,909 INFO L226 Difference]: Without dead ends: 5003 [2022-03-15 22:22:33,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=954, Invalid=3336, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:22:33,910 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:33,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-03-15 22:22:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 4098. [2022-03-15 22:22:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 4.445203807664145) internal successors, (18212), 4097 states have internal predecessors, (18212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 18212 transitions. [2022-03-15 22:22:33,990 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 18212 transitions. Word has length 18 [2022-03-15 22:22:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:33,990 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 18212 transitions. [2022-03-15 22:22:33,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 18212 transitions. [2022-03-15 22:22:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:33,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:33,997 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:34,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2022-03-15 22:22:34,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-03-15 22:22:34,199 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1359468283, now seen corresponding path program 94 times [2022-03-15 22:22:34,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:34,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370872470] [2022-03-15 22:22:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:34,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:34,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370872470] [2022-03-15 22:22:34,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370872470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:34,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299716003] [2022-03-15 22:22:34,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:34,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:34,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:34,244 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:34,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 22:22:34,317 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:34,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:34,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:34,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:34,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:34,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299716003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:34,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:34,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2022-03-15 22:22:34,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694041423] [2022-03-15 22:22:34,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:34,511 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:34,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 55 transitions. [2022-03-15 22:22:34,514 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:34,730 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [683315#(< k N), 683321#(or (<= (+ N j 1) (+ M i)) (< k N)), 683316#(<= N i), 683317#(or (<= N i) (< k N)), 683320#(or (< k N) (<= (+ N j) (+ M i))), 683318#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 683322#(or (< k N) (<= (+ N j) (+ M i 1))), 683319#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:22:34,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:22:34,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:22:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:34,731 INFO L87 Difference]: Start difference. First operand 4098 states and 18212 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:35,240 INFO L93 Difference]: Finished difference Result 5032 states and 20990 transitions. [2022-03-15 22:22:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 22:22:35,241 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:35,251 INFO L225 Difference]: With dead ends: 5032 [2022-03-15 22:22:35,251 INFO L226 Difference]: Without dead ends: 5028 [2022-03-15 22:22:35,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=680, Invalid=2400, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 22:22:35,252 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:35,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2022-03-15 22:22:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 4174. [2022-03-15 22:22:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 4173 states have (on average 4.45602683920441) internal successors, (18595), 4173 states have internal predecessors, (18595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 18595 transitions. [2022-03-15 22:22:35,351 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 18595 transitions. Word has length 18 [2022-03-15 22:22:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:35,351 INFO L470 AbstractCegarLoop]: Abstraction has 4174 states and 18595 transitions. [2022-03-15 22:22:35,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 18595 transitions. [2022-03-15 22:22:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:35,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:35,358 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:35,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2022-03-15 22:22:35,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 22:22:35,559 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash -504161629, now seen corresponding path program 95 times [2022-03-15 22:22:35,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:35,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743154843] [2022-03-15 22:22:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:35,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:35,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743154843] [2022-03-15 22:22:35,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743154843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:35,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878192201] [2022-03-15 22:22:35,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:35,608 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:35,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 22:22:35,685 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:22:35,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:35,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:35,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:35,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:35,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878192201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:35,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:35,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 22:22:35,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101743789] [2022-03-15 22:22:35,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:35,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:35,878 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 22:22:35,878 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:36,146 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [696880#(< k N), 696886#(or (< k N) (<= (+ N j) (+ M i))), 696887#(or (< k N) (<= (+ N j) (+ M i 1))), 696882#(or (<= (+ 2 j) M) (< k N) (<= M j)), 696885#(or (<= (+ N j 1) (+ M i)) (< k N)), 696883#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 696884#(or (<= (+ 2 j) M) (< k N)), 696879#(or (<= (+ 2 j) M) (<= M j)), 696881#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:22:36,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:22:36,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:22:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:22:36,147 INFO L87 Difference]: Start difference. First operand 4174 states and 18595 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:37,485 INFO L93 Difference]: Finished difference Result 5175 states and 21472 transitions. [2022-03-15 22:22:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 22:22:37,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:37,497 INFO L225 Difference]: With dead ends: 5175 [2022-03-15 22:22:37,498 INFO L226 Difference]: Without dead ends: 5169 [2022-03-15 22:22:37,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1205, Invalid=5601, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 22:22:37,499 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:37,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2022-03-15 22:22:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 4171. [2022-03-15 22:22:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4170 states have (on average 4.458992805755396) internal successors, (18594), 4170 states have internal predecessors, (18594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 18594 transitions. [2022-03-15 22:22:37,576 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 18594 transitions. Word has length 18 [2022-03-15 22:22:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:37,576 INFO L470 AbstractCegarLoop]: Abstraction has 4171 states and 18594 transitions. [2022-03-15 22:22:37,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 18594 transitions. [2022-03-15 22:22:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:37,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:37,584 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:37,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-03-15 22:22:37,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-03-15 22:22:37,785 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1277329315, now seen corresponding path program 96 times [2022-03-15 22:22:37,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:37,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004707984] [2022-03-15 22:22:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:37,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:37,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004707984] [2022-03-15 22:22:37,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004707984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:37,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932174783] [2022-03-15 22:22:37,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:37,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:37,834 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:37,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 22:22:37,910 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:22:37,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:37,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:37,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:38,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:38,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932174783] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:38,107 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:38,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 22 [2022-03-15 22:22:38,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143189607] [2022-03-15 22:22:38,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:38,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:38,110 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 22:22:38,110 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:38,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [710637#(or (< k N) (<= (+ j 1) M)), 710639#(or (< k N) (<= (+ N j) (+ M i))), 710638#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 710636#(or (<= N i) (< k N)), 710634#(< k N), 710635#(<= N i)] [2022-03-15 22:22:38,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:22:38,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:22:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:22:38,272 INFO L87 Difference]: Start difference. First operand 4171 states and 18594 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:38,935 INFO L93 Difference]: Finished difference Result 5311 states and 21947 transitions. [2022-03-15 22:22:38,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:22:38,936 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:38,950 INFO L225 Difference]: With dead ends: 5311 [2022-03-15 22:22:38,950 INFO L226 Difference]: Without dead ends: 5305 [2022-03-15 22:22:38,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=772, Invalid=3010, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:22:38,952 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:38,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2022-03-15 22:22:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4132. [2022-03-15 22:22:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 4131 states have (on average 4.455821834906803) internal successors, (18407), 4131 states have internal predecessors, (18407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 18407 transitions. [2022-03-15 22:22:39,043 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 18407 transitions. Word has length 18 [2022-03-15 22:22:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:39,043 INFO L470 AbstractCegarLoop]: Abstraction has 4132 states and 18407 transitions. [2022-03-15 22:22:39,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 18407 transitions. [2022-03-15 22:22:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:39,051 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:39,051 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:39,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-03-15 22:22:39,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:39,253 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2132635969, now seen corresponding path program 97 times [2022-03-15 22:22:39,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:39,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255061442] [2022-03-15 22:22:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:39,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:39,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255061442] [2022-03-15 22:22:39,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255061442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:39,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537269007] [2022-03-15 22:22:39,301 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:39,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:39,302 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:39,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 22:22:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:39,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:39,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:39,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537269007] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:39,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:39,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-03-15 22:22:39,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004299238] [2022-03-15 22:22:39,560 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:39,561 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:39,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:22:39,564 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:39,757 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [724405#(or (<= (+ 2 j) M) (<= M j)), 724404#(< k N), 724406#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 724408#(or (<= (+ 2 j) M) (< k N) (<= M j)), 724409#(or (<= (+ 2 j) M) (< k N)), 724407#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:22:39,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:22:39,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:22:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:22:39,757 INFO L87 Difference]: Start difference. First operand 4132 states and 18407 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:40,811 INFO L93 Difference]: Finished difference Result 5039 states and 20844 transitions. [2022-03-15 22:22:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:22:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:40,823 INFO L225 Difference]: With dead ends: 5039 [2022-03-15 22:22:40,823 INFO L226 Difference]: Without dead ends: 5036 [2022-03-15 22:22:40,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=931, Invalid=4039, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 22:22:40,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:40,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2022-03-15 22:22:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4061. [2022-03-15 22:22:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 4060 states have (on average 4.43448275862069) internal successors, (18004), 4060 states have internal predecessors, (18004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 18004 transitions. [2022-03-15 22:22:40,927 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 18004 transitions. Word has length 18 [2022-03-15 22:22:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:40,927 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 18004 transitions. [2022-03-15 22:22:40,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 18004 transitions. [2022-03-15 22:22:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:40,934 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:40,934 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:40,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2022-03-15 22:22:41,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:41,145 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2091052255, now seen corresponding path program 98 times [2022-03-15 22:22:41,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:41,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300349255] [2022-03-15 22:22:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:41,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:41,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300349255] [2022-03-15 22:22:41,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300349255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:41,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322524481] [2022-03-15 22:22:41,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:41,189 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:41,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 22:22:41,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:41,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:41,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:41,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:41,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:41,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322524481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:41,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:41,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 20 [2022-03-15 22:22:41,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314540874] [2022-03-15 22:22:41,448 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:41,449 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:41,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 22:22:41,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:41,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [737786#(or (<= N i) (< k N)), 737784#(<= N i), 737785#(<= N (+ i 1)), 737790#(or (< k N) (<= (+ N j) (+ M i 1))), 737787#(or (<= N (+ i 1)) (< k N)), 737789#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 737782#(< k N), 737788#(or (< k N) (<= (+ N j) (+ M i))), 737783#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:22:41,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:22:41,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:22:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:41,658 INFO L87 Difference]: Start difference. First operand 4061 states and 18004 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:42,309 INFO L93 Difference]: Finished difference Result 5361 states and 21990 transitions. [2022-03-15 22:22:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:22:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:42,321 INFO L225 Difference]: With dead ends: 5361 [2022-03-15 22:22:42,322 INFO L226 Difference]: Without dead ends: 5359 [2022-03-15 22:22:42,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=863, Invalid=3169, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:22:42,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:42,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2022-03-15 22:22:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 4138. [2022-03-15 22:22:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4138 states, 4137 states have (on average 4.4331641285956005) internal successors, (18340), 4137 states have internal predecessors, (18340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 18340 transitions. [2022-03-15 22:22:42,407 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 18340 transitions. Word has length 18 [2022-03-15 22:22:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:42,407 INFO L470 AbstractCegarLoop]: Abstraction has 4138 states and 18340 transitions. [2022-03-15 22:22:42,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 18340 transitions. [2022-03-15 22:22:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:42,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:42,414 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:42,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2022-03-15 22:22:42,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-03-15 22:22:42,615 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -603905889, now seen corresponding path program 99 times [2022-03-15 22:22:42,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:42,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455453872] [2022-03-15 22:22:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:42,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:42,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455453872] [2022-03-15 22:22:42,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455453872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:42,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671830186] [2022-03-15 22:22:42,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:42,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:42,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:42,672 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:42,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-03-15 22:22:42,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:22:42,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:42,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:42,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:42,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:22:42,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671830186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:42,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:42,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-03-15 22:22:42,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575884735] [2022-03-15 22:22:42,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:42,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:42,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 22:22:42,930 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:43,145 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [751622#(or (<= (+ 2 j) M) (< k N) (<= M j)), 751621#(or (<= (+ 2 j) M) (<= M j)), 751620#(or (< k N) (<= (+ j 1) M)), 751625#(or (<= (+ N j 1) (+ M i)) (< k N)), 751619#(< k N), 751623#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 751624#(or (<= (+ 2 j) M) (< k N))] [2022-03-15 22:22:43,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:22:43,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:22:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:22:43,146 INFO L87 Difference]: Start difference. First operand 4138 states and 18340 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:44,028 INFO L93 Difference]: Finished difference Result 4780 states and 20231 transitions. [2022-03-15 22:22:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:22:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:44,040 INFO L225 Difference]: With dead ends: 4780 [2022-03-15 22:22:44,040 INFO L226 Difference]: Without dead ends: 4780 [2022-03-15 22:22:44,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=726, Invalid=3434, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:22:44,040 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:44,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2022-03-15 22:22:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4156. [2022-03-15 22:22:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 4155 states have (on average 4.431528279181709) internal successors, (18413), 4155 states have internal predecessors, (18413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 18413 transitions. [2022-03-15 22:22:44,113 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 18413 transitions. Word has length 18 [2022-03-15 22:22:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:44,113 INFO L470 AbstractCegarLoop]: Abstraction has 4156 states and 18413 transitions. [2022-03-15 22:22:44,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 18413 transitions. [2022-03-15 22:22:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:44,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:44,121 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:44,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-03-15 22:22:44,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130 [2022-03-15 22:22:44,321 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash -983111707, now seen corresponding path program 100 times [2022-03-15 22:22:44,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:44,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574451851] [2022-03-15 22:22:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:44,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:44,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:44,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574451851] [2022-03-15 22:22:44,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574451851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:44,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812659123] [2022-03-15 22:22:44,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:44,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:44,380 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-03-15 22:22:44,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:44,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:44,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:44,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:44,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:44,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812659123] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:44,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:44,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 21 [2022-03-15 22:22:44,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635528203] [2022-03-15 22:22:44,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:44,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:44,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 89 transitions. [2022-03-15 22:22:44,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:45,185 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [764929#(or (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 764930#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= N (+ 3 i)) (<= M j)), 764927#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)), 764885#(or (<= (+ 2 k) N) (< j M)), 764920#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 764918#(or (<= (+ k 1) N) (< j M)), 764921#(or (< k N) (< i N)), 764924#(or (<= N i) (<= (+ 2 k) N) (< j M)), 764917#(< j M), 764926#(or (<= N (+ 2 i)) (<= (+ 2 k) N)), 764919#(or (<= N i) (<= (+ 2 k) N)), 764923#(or (< j M) (< k N) (< i N)), 764922#(or (< j M) (< i N)), 764928#(or (<= (+ 2 k) N) (<= N (+ 3 i))), 764931#(or (<= (+ 2 k) N) (<= N (+ 3 i)) (< (+ 2 j) M) (<= M (+ j 1))), 764925#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 764916#(< i N)] [2022-03-15 22:22:45,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:22:45,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:45,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:22:45,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:22:45,186 INFO L87 Difference]: Start difference. First operand 4156 states and 18413 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:46,589 INFO L93 Difference]: Finished difference Result 6515 states and 25890 transitions. [2022-03-15 22:22:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 22:22:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:46,604 INFO L225 Difference]: With dead ends: 6515 [2022-03-15 22:22:46,604 INFO L226 Difference]: Without dead ends: 6515 [2022-03-15 22:22:46,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1615, Invalid=6041, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:22:46,606 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 442 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:46,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 0 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2022-03-15 22:22:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 4620. [2022-03-15 22:22:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4620 states, 4619 states have (on average 4.431695172115177) internal successors, (20470), 4619 states have internal predecessors, (20470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 20470 transitions. [2022-03-15 22:22:46,735 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 20470 transitions. Word has length 18 [2022-03-15 22:22:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:46,735 INFO L470 AbstractCegarLoop]: Abstraction has 4620 states and 20470 transitions. [2022-03-15 22:22:46,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 20470 transitions. [2022-03-15 22:22:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:46,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:46,744 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:46,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2022-03-15 22:22:46,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:46,944 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2044312917, now seen corresponding path program 101 times [2022-03-15 22:22:46,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:46,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649640063] [2022-03-15 22:22:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:47,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:47,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649640063] [2022-03-15 22:22:47,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649640063] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:47,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688159887] [2022-03-15 22:22:47,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:47,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:47,011 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:47,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-03-15 22:22:47,089 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:22:47,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:47,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:47,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:47,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:47,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688159887] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:47,253 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:47,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-03-15 22:22:47,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216937868] [2022-03-15 22:22:47,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:47,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:47,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:22:47,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:47,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [780915#(or (<= N (+ i 1)) (<= k (+ i 1))), 780914#(or (<= N i) (<= k i) (< j M)), 780917#(or (<= N (+ 2 i)) (<= k (+ 2 i))), 780916#(or (<= N (+ i 1)) (< j M) (<= k (+ i 1))), 780910#(or (<= N i) (< j M)), 780882#(or (< j M) (<= (+ k 1) i)), 780918#(or (<= N (+ 2 i)) (< j M) (<= k (+ 2 i))), 780913#(or (<= N i) (<= k i)), 780886#(or (<= k i) (< j M)), 780912#(or (< j M) (< k N)), 780920#(or (<= N (+ 2 i)) (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 780919#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 780909#(< j M), 780911#(< k N)] [2022-03-15 22:22:47,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:22:47,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:22:47,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:22:47,558 INFO L87 Difference]: Start difference. First operand 4620 states and 20470 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:48,396 INFO L93 Difference]: Finished difference Result 6044 states and 25228 transitions. [2022-03-15 22:22:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:22:48,396 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:48,409 INFO L225 Difference]: With dead ends: 6044 [2022-03-15 22:22:48,409 INFO L226 Difference]: Without dead ends: 6041 [2022-03-15 22:22:48,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1135, Invalid=3155, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:22:48,410 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:48,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:22:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-03-15 22:22:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 4839. [2022-03-15 22:22:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4838 states have (on average 4.454733360892931) internal successors, (21552), 4838 states have internal predecessors, (21552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 21552 transitions. [2022-03-15 22:22:48,505 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 21552 transitions. Word has length 18 [2022-03-15 22:22:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:48,505 INFO L470 AbstractCegarLoop]: Abstraction has 4839 states and 21552 transitions. [2022-03-15 22:22:48,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 21552 transitions. [2022-03-15 22:22:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:48,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:48,513 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:48,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2022-03-15 22:22:48,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:48,714 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -56010301, now seen corresponding path program 102 times [2022-03-15 22:22:48,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:48,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265363374] [2022-03-15 22:22:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:48,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:48,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265363374] [2022-03-15 22:22:48,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265363374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:48,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966698022] [2022-03-15 22:22:48,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:48,791 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:48,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-03-15 22:22:48,872 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:22:48,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:48,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:48,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:48,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:49,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966698022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:49,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:49,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 17 [2022-03-15 22:22:49,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335578297] [2022-03-15 22:22:49,016 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:49,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:49,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:22:49,021 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:49,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [796831#(< k N), 796835#(or (<= N (+ i 1)) (< j M)), 796840#(or (<= N i) (< j M) (<= k (+ i 1))), 796808#(or (<= k i) (< j M)), 796838#(or (<= N i) (< k N)), 796841#(or (<= N (+ i 1)) (< j M) (<= k (+ 2 i))), 796843#(or (<= N (+ i 1)) (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 796842#(or (<= N (+ i 1)) (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 796833#(or (< j M) (< k N)), 796832#(< j M), 796812#(or (< j M) (<= k (+ i 1))), 796839#(or (<= N i) (< j M) (< k N)), 796837#(or (<= N (+ i 1)) (<= k (+ 2 i))), 796834#(or (<= N i) (< j M)), 796836#(or (<= N i) (<= k (+ i 1)))] [2022-03-15 22:22:49,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:22:49,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:22:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:22:49,316 INFO L87 Difference]: Start difference. First operand 4839 states and 21552 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:50,113 INFO L93 Difference]: Finished difference Result 6297 states and 26341 transitions. [2022-03-15 22:22:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:22:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:50,129 INFO L225 Difference]: With dead ends: 6297 [2022-03-15 22:22:50,129 INFO L226 Difference]: Without dead ends: 6295 [2022-03-15 22:22:50,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1004, Invalid=3028, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:22:50,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:50,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2022-03-15 22:22:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 5034. [2022-03-15 22:22:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 5033 states have (on average 4.44923504867872) internal successors, (22393), 5033 states have internal predecessors, (22393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 22393 transitions. [2022-03-15 22:22:50,235 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 22393 transitions. Word has length 18 [2022-03-15 22:22:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:50,235 INFO L470 AbstractCegarLoop]: Abstraction has 5034 states and 22393 transitions. [2022-03-15 22:22:50,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 22393 transitions. [2022-03-15 22:22:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:50,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:50,244 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:50,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:50,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-03-15 22:22:50,444 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 950195907, now seen corresponding path program 103 times [2022-03-15 22:22:50,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:50,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278921525] [2022-03-15 22:22:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:50,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:50,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:50,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278921525] [2022-03-15 22:22:50,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278921525] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:50,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366827404] [2022-03-15 22:22:50,498 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:50,499 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-03-15 22:22:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:50,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:50,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:50,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:50,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366827404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:50,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:50,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-03-15 22:22:50,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504145682] [2022-03-15 22:22:50,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:50,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:50,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:22:50,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:51,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [813400#(or (<= N i) (< k N)), 813397#(or (<= N (+ 2 i)) (< j M)), 813395#(or (<= N i) (< j M)), 813399#(or (< j M) (<= N (+ 3 i))), 813394#(< j M), 813405#(or (<= N (+ i 1)) (< j M) (< k N)), 813409#(or (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 813403#(or (< j M) (< k N)), 813407#(or (<= k (+ 3 i)) (< j M)), 813402#(or (<= N (+ 2 i)) (< k N)), 813396#(or (<= N (+ i 1)) (< j M)), 813401#(or (<= N (+ i 1)) (< k N)), 813408#(or (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 813404#(or (<= N i) (< j M) (< k N)), 813398#(< k N), 813406#(or (<= N (+ 2 i)) (< j M) (< k N)), 813379#(or (< j M) (<= k (+ 2 i)))] [2022-03-15 22:22:51,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:22:51,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:22:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:22:51,041 INFO L87 Difference]: Start difference. First operand 5034 states and 22393 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:52,388 INFO L93 Difference]: Finished difference Result 7344 states and 29990 transitions. [2022-03-15 22:22:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 22:22:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 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 18 [2022-03-15 22:22:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:52,406 INFO L225 Difference]: With dead ends: 7344 [2022-03-15 22:22:52,406 INFO L226 Difference]: Without dead ends: 7339 [2022-03-15 22:22:52,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1856, Invalid=6700, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 22:22:52,407 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:52,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2022-03-15 22:22:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 5343. [2022-03-15 22:22:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 4.430175964058405) internal successors, (23666), 5342 states have internal predecessors, (23666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 23666 transitions. [2022-03-15 22:22:52,523 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 23666 transitions. Word has length 18 [2022-03-15 22:22:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:52,523 INFO L470 AbstractCegarLoop]: Abstraction has 5343 states and 23666 transitions. [2022-03-15 22:22:52,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 23666 transitions. [2022-03-15 22:22:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:52,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:52,533 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:52,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2022-03-15 22:22:52,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-03-15 22:22:52,735 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash -690651645, now seen corresponding path program 104 times [2022-03-15 22:22:52,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:52,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914897682] [2022-03-15 22:22:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:52,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:52,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914897682] [2022-03-15 22:22:52,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914897682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:52,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879454332] [2022-03-15 22:22:52,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:52,787 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:52,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-03-15 22:22:52,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:52,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:52,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:52,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:52,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:53,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879454332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:53,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:53,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 17 [2022-03-15 22:22:53,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725515831] [2022-03-15 22:22:53,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:53,007 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:53,010 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 22:22:53,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:53,274 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [831686#(or (<= N i) (< j M) (< k N)), 831690#(or (<= N (+ i 1)) (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 831691#(or (<= N (+ i 1)) (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 831684#(or (<= N (+ i 1)) (< j M)), 831657#(or (<= k i) (< j M)), 831689#(or (< (+ j 1) M) (<= N i) (<= k (+ i 1)) (<= M j)), 831682#(or (< j M) (< k N)), 831685#(or (<= N i) (< k N)), 831683#(or (<= N i) (< j M)), 831681#(< j M), 831680#(< k N), 831687#(or (< j M) (<= k (+ i 1))), 831688#(or (< (+ j 1) M) (<= k i) (<= M j))] [2022-03-15 22:22:53,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:22:53,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:53,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:22:53,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:53,275 INFO L87 Difference]: Start difference. First operand 5343 states and 23666 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:54,720 INFO L93 Difference]: Finished difference Result 7860 states and 31570 transitions. [2022-03-15 22:22:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 22:22:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:54,738 INFO L225 Difference]: With dead ends: 7860 [2022-03-15 22:22:54,738 INFO L226 Difference]: Without dead ends: 7857 [2022-03-15 22:22:54,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1836, Invalid=5820, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:22:54,739 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:54,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2022-03-15 22:22:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 5502. [2022-03-15 22:22:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5502 states, 5501 states have (on average 4.433375749863661) internal successors, (24388), 5501 states have internal predecessors, (24388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 24388 transitions. [2022-03-15 22:22:54,866 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 24388 transitions. Word has length 18 [2022-03-15 22:22:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:54,866 INFO L470 AbstractCegarLoop]: Abstraction has 5502 states and 24388 transitions. [2022-03-15 22:22:54,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 24388 transitions. [2022-03-15 22:22:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:54,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:54,876 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:54,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2022-03-15 22:22:55,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-03-15 22:22:55,076 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -752920183, now seen corresponding path program 105 times [2022-03-15 22:22:55,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:55,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109983630] [2022-03-15 22:22:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:55,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:55,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109983630] [2022-03-15 22:22:55,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109983630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:55,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394093488] [2022-03-15 22:22:55,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:55,206 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:55,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-03-15 22:22:55,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:22:55,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:55,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:55,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:55,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:55,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394093488] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:55,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:55,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-03-15 22:22:55,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558658627] [2022-03-15 22:22:55,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:55,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:55,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2022-03-15 22:22:55,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:55,756 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [850798#(or (< j M) (< k N)), 850797#(< k N), 850800#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 850795#(< j M), 850796#(or (<= N i) (< j M)), 850803#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 850802#(or (<= N (+ i 1)) (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 850804#(or (<= N (+ 2 i)) (<= k (+ 2 i)) (< (+ 2 j) M) (<= M (+ j 1))), 850768#(or (< j M) (<= (+ k 1) i)), 850799#(or (<= k i) (< j M)), 850801#(or (< (+ j 1) M) (<= N i) (<= k i) (<= M j))] [2022-03-15 22:22:55,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:22:55,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:22:55,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:22:55,756 INFO L87 Difference]: Start difference. First operand 5502 states and 24388 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:57,404 INFO L93 Difference]: Finished difference Result 8288 states and 33365 transitions. [2022-03-15 22:22:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 22:22:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:57,423 INFO L225 Difference]: With dead ends: 8288 [2022-03-15 22:22:57,423 INFO L226 Difference]: Without dead ends: 8281 [2022-03-15 22:22:57,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1958, Invalid=6414, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 22:22:57,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:57,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2022-03-15 22:22:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 5718. [2022-03-15 22:22:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 4.471226167570404) internal successors, (25562), 5717 states have internal predecessors, (25562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 25562 transitions. [2022-03-15 22:22:57,559 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 25562 transitions. Word has length 18 [2022-03-15 22:22:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:57,559 INFO L470 AbstractCegarLoop]: Abstraction has 5718 states and 25562 transitions. [2022-03-15 22:22:57,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 25562 transitions. [2022-03-15 22:22:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:57,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:57,569 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:57,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:57,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-03-15 22:22:57,769 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1559426689, now seen corresponding path program 106 times [2022-03-15 22:22:57,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:57,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410148099] [2022-03-15 22:22:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:57,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:57,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410148099] [2022-03-15 22:22:57,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410148099] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:57,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215220718] [2022-03-15 22:22:57,827 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:57,828 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:57,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-03-15 22:22:57,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:57,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:57,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:57,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:57,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:58,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215220718] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:58,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:58,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-03-15 22:22:58,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787950602] [2022-03-15 22:22:58,055 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:58,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:58,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:22:58,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:58,334 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [870776#(< k N), 870756#(or (< j M) (<= (+ k 1) i)), 870782#(or (<= N i) (< j M) (<= (+ k 1) i)), 870777#(or (<= N i) (<= (+ k 1) i)), 870779#(or (<= N (+ 2 i)) (<= k (+ i 1))), 870780#(or (<= N i) (< j M)), 870778#(or (<= N (+ i 1)) (<= k i)), 870781#(or (< j M) (< k N)), 870760#(or (<= k i) (< j M)), 870783#(or (<= N (+ i 1)) (<= k i) (< j M)), 870775#(< j M), 870785#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 870752#(or (<= (+ 2 k) i) (< j M)), 870784#(or (<= N (+ 2 i)) (< j M) (<= k (+ i 1)))] [2022-03-15 22:22:58,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:22:58,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:22:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:22:58,334 INFO L87 Difference]: Start difference. First operand 5718 states and 25562 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:59,237 INFO L93 Difference]: Finished difference Result 7112 states and 29748 transitions. [2022-03-15 22:22:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:22:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:59,254 INFO L225 Difference]: With dead ends: 7112 [2022-03-15 22:22:59,254 INFO L226 Difference]: Without dead ends: 7106 [2022-03-15 22:22:59,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1200, Invalid=3630, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:22:59,255 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:59,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:22:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2022-03-15 22:22:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 5798. [2022-03-15 22:22:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5798 states, 5797 states have (on average 4.442815249266862) internal successors, (25755), 5797 states have internal predecessors, (25755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 25755 transitions. [2022-03-15 22:22:59,391 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 25755 transitions. Word has length 18 [2022-03-15 22:22:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:59,392 INFO L470 AbstractCegarLoop]: Abstraction has 5798 states and 25755 transitions. [2022-03-15 22:22:59,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 25755 transitions. [2022-03-15 22:22:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:59,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:59,402 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:59,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2022-03-15 22:22:59,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:59,602 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2127535535, now seen corresponding path program 107 times [2022-03-15 22:22:59,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:59,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487265480] [2022-03-15 22:22:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:59,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:59,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487265480] [2022-03-15 22:22:59,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487265480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:59,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756135500] [2022-03-15 22:22:59,655 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:59,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:59,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:59,656 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:22:59,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-03-15 22:22:59,739 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:22:59,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:59,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:59,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:59,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:22:59,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756135500] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:59,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:59,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:22:59,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864644023] [2022-03-15 22:22:59,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:59,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:59,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 64 transitions. [2022-03-15 22:22:59,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:00,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [889692#(or (< k N) (< i N)), 889695#(or (< j M) (<= (+ k 1) i)), 889698#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 889693#(or (< j M) (< k N) (< i N)), 889691#(or (< j M) (< i N)), 889694#(or (<= (+ 2 k) N) (< j M)), 889690#(< i N), 889688#(< j M), 889697#(or (< j M) (<= k (+ 2 i))), 889689#(or (<= (+ k 1) N) (< j M)), 889696#(or (<= k i) (< j M)), 889677#(or (< j M) (<= k (+ i 1)))] [2022-03-15 22:23:00,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:23:00,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:23:00,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:23:00,117 INFO L87 Difference]: Start difference. First operand 5798 states and 25755 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:00,902 INFO L93 Difference]: Finished difference Result 7551 states and 31541 transitions. [2022-03-15 22:23:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 22:23:00,902 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:00,921 INFO L225 Difference]: With dead ends: 7551 [2022-03-15 22:23:00,922 INFO L226 Difference]: Without dead ends: 7551 [2022-03-15 22:23:00,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:23:00,922 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:00,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:23:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7551 states. [2022-03-15 22:23:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7551 to 6203. [2022-03-15 22:23:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6203 states, 6202 states have (on average 4.4422766849403414) internal successors, (27551), 6202 states have internal predecessors, (27551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 27551 transitions. [2022-03-15 22:23:01,111 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 27551 transitions. Word has length 18 [2022-03-15 22:23:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:01,111 INFO L470 AbstractCegarLoop]: Abstraction has 6203 states and 27551 transitions. [2022-03-15 22:23:01,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 27551 transitions. [2022-03-15 22:23:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:01,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:01,123 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:01,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:01,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-03-15 22:23:01,323 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 361929485, now seen corresponding path program 108 times [2022-03-15 22:23:01,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:01,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400908910] [2022-03-15 22:23:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:01,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:01,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400908910] [2022-03-15 22:23:01,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400908910] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:01,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444194080] [2022-03-15 22:23:01,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:01,389 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:01,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-03-15 22:23:01,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:01,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:01,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:01,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:01,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:01,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444194080] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:01,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:01,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-03-15 22:23:01,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1976504948] [2022-03-15 22:23:01,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:01,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:01,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:23:01,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:01,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [909852#(< k N), 909855#(or (<= N (+ 2 i)) (< k N)), 909858#(or (<= N (+ i 1)) (< j M) (< k N)), 909861#(or (< j M) (<= k (+ 2 i))), 909860#(or (<= k (+ 3 i)) (< j M)), 909847#(< j M), 909854#(or (<= N (+ i 1)) (< k N)), 909857#(or (<= N i) (< j M) (< k N)), 909848#(or (<= N i) (< j M)), 909853#(or (<= N i) (< k N)), 909850#(or (<= N (+ 2 i)) (< j M)), 909859#(or (<= N (+ 2 i)) (< j M) (< k N)), 909862#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 909851#(or (< j M) (<= N (+ 3 i))), 909849#(or (<= N (+ i 1)) (< j M)), 909856#(or (< j M) (< k N)), 909836#(or (< j M) (<= k (+ i 1)))] [2022-03-15 22:23:01,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:01,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:01,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:01,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:23:01,894 INFO L87 Difference]: Start difference. First operand 6203 states and 27551 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:02,827 INFO L93 Difference]: Finished difference Result 8253 states and 34043 transitions. [2022-03-15 22:23:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 22:23:02,827 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 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 18 [2022-03-15 22:23:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:02,847 INFO L225 Difference]: With dead ends: 8253 [2022-03-15 22:23:02,847 INFO L226 Difference]: Without dead ends: 8247 [2022-03-15 22:23:02,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1296, Invalid=4556, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:23:02,848 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:02,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:23:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-15 22:23:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 6376. [2022-03-15 22:23:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6376 states, 6375 states have (on average 4.437647058823529) internal successors, (28290), 6375 states have internal predecessors, (28290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6376 states to 6376 states and 28290 transitions. [2022-03-15 22:23:02,995 INFO L78 Accepts]: Start accepts. Automaton has 6376 states and 28290 transitions. Word has length 18 [2022-03-15 22:23:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:02,995 INFO L470 AbstractCegarLoop]: Abstraction has 6376 states and 28290 transitions. [2022-03-15 22:23:02,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6376 states and 28290 transitions. [2022-03-15 22:23:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:03,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:03,007 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:03,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:03,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-03-15 22:23:03,223 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:03,223 INFO L85 PathProgramCache]: Analyzing trace with hash -259672539, now seen corresponding path program 31 times [2022-03-15 22:23:03,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:03,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646350676] [2022-03-15 22:23:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:03,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:03,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646350676] [2022-03-15 22:23:03,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646350676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:03,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756766085] [2022-03-15 22:23:03,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:03,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:03,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:03,270 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:03,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-03-15 22:23:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:03,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:03,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:03,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756766085] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:03,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:03,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 22:23:03,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722214794] [2022-03-15 22:23:03,452 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:03,452 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:03,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 76 transitions. [2022-03-15 22:23:03,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:03,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [931080#(or (< j M) (< k N) (< i N)), 931075#(or (<= (+ k 1) N) (< j M)), 931083#(or (<= (+ 3 k) N) (< j M)), 931078#(or (< j M) (< i N)), 931067#(or (<= k i) (< j M)), 931084#(or (<= (+ 2 k) i) (< j M)), 931086#(or (< j M) (<= k (+ i 1))), 931077#(< i N), 931085#(or (< j M) (<= (+ k 1) i)), 931079#(or (< k N) (< i N)), 931076#(or (<= (+ 2 k) N) (< j M)), 931074#(< j M), 931082#(or (<= (+ 2 k) N) (< j M) (< i N)), 931081#(or (<= (+ 2 k) N) (< i N))] [2022-03-15 22:23:03,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:23:03,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:23:03,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:23:03,788 INFO L87 Difference]: Start difference. First operand 6376 states and 28290 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:04,338 INFO L93 Difference]: Finished difference Result 6918 states and 29962 transitions. [2022-03-15 22:23:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 22:23:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:04,354 INFO L225 Difference]: With dead ends: 6918 [2022-03-15 22:23:04,354 INFO L226 Difference]: Without dead ends: 6918 [2022-03-15 22:23:04,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=562, Invalid=1988, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:23:04,355 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:04,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2022-03-15 22:23:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6415. [2022-03-15 22:23:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6415 states, 6414 states have (on average 4.446990957280948) internal successors, (28523), 6414 states have internal predecessors, (28523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6415 states to 6415 states and 28523 transitions. [2022-03-15 22:23:04,474 INFO L78 Accepts]: Start accepts. Automaton has 6415 states and 28523 transitions. Word has length 18 [2022-03-15 22:23:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:04,475 INFO L470 AbstractCegarLoop]: Abstraction has 6415 states and 28523 transitions. [2022-03-15 22:23:04,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6415 states and 28523 transitions. [2022-03-15 22:23:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:04,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:04,487 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:04,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2022-03-15 22:23:04,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:04,691 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -694460413, now seen corresponding path program 32 times [2022-03-15 22:23:04,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:04,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468775248] [2022-03-15 22:23:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:04,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:04,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468775248] [2022-03-15 22:23:04,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468775248] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:04,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116923934] [2022-03-15 22:23:04,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:04,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:04,740 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:04,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-03-15 22:23:04,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:04,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:04,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:04,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:04,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:04,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116923934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:04,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:04,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2022-03-15 22:23:04,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485177551] [2022-03-15 22:23:04,898 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:04,898 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:04,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 22:23:04,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:05,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [951006#(or (< j M) (<= N (+ 3 i))), 951016#(or (< j M) (<= k (+ 2 i))), 950995#(or (<= k i) (< j M)), 951008#(or (<= N i) (< k N)), 951002#(< j M), 951013#(or (<= N (+ 2 i)) (< k N)), 951017#(or (< j M) (<= k (+ i 1))), 951003#(or (<= N i) (< j M)), 951004#(or (<= N (+ i 1)) (< j M)), 951014#(or (<= N (+ 2 i)) (< j M) (< k N)), 951007#(< k N), 951005#(or (<= N (+ 2 i)) (< j M)), 951012#(or (<= N (+ i 1)) (< j M) (< k N)), 951015#(or (<= k (+ 3 i)) (< j M)), 951011#(or (<= N (+ i 1)) (< k N)), 951010#(or (<= N i) (< j M) (< k N)), 951009#(or (< j M) (< k N))] [2022-03-15 22:23:05,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:05,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:23:05,213 INFO L87 Difference]: Start difference. First operand 6415 states and 28523 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:05,740 INFO L93 Difference]: Finished difference Result 7094 states and 30650 transitions. [2022-03-15 22:23:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:23:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 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 18 [2022-03-15 22:23:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:05,756 INFO L225 Difference]: With dead ends: 7094 [2022-03-15 22:23:05,757 INFO L226 Difference]: Without dead ends: 7090 [2022-03-15 22:23:05,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=715, Invalid=2147, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 22:23:05,757 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:05,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2022-03-15 22:23:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 6519. [2022-03-15 22:23:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6519 states, 6518 states have (on average 4.44430806996011) internal successors, (28968), 6518 states have internal predecessors, (28968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 28968 transitions. [2022-03-15 22:23:05,881 INFO L78 Accepts]: Start accepts. Automaton has 6519 states and 28968 transitions. Word has length 18 [2022-03-15 22:23:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:05,881 INFO L470 AbstractCegarLoop]: Abstraction has 6519 states and 28968 transitions. [2022-03-15 22:23:05,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6519 states and 28968 transitions. [2022-03-15 22:23:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:05,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:05,893 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:05,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:06,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:06,094 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash -52563123, now seen corresponding path program 109 times [2022-03-15 22:23:06,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:06,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446651009] [2022-03-15 22:23:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:06,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:06,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:06,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446651009] [2022-03-15 22:23:06,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446651009] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:06,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477402227] [2022-03-15 22:23:06,145 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:06,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:06,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:06,146 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:06,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-03-15 22:23:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:06,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:06,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:06,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:06,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477402227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:06,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:06,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-03-15 22:23:06,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462885804] [2022-03-15 22:23:06,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:06,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:06,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 52 transitions. [2022-03-15 22:23:06,465 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:06,673 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [971332#(or (<= (+ 2 j) M) (< i N)), 971329#(or (< k N) (< i N)), 971327#(or (< k N) (<= (+ j 1) M)), 971328#(< i N), 971331#(or (< j M) (< k N) (< i N)), 971333#(or (<= (+ 2 k j) (+ N M)) (< i N)), 971326#(< k N), 971330#(or (<= (+ j 1) M) (< i N))] [2022-03-15 22:23:06,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:23:06,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:23:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:23:06,674 INFO L87 Difference]: Start difference. First operand 6519 states and 28968 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:07,232 INFO L93 Difference]: Finished difference Result 8196 states and 34345 transitions. [2022-03-15 22:23:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 22:23:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:07,254 INFO L225 Difference]: With dead ends: 8196 [2022-03-15 22:23:07,254 INFO L226 Difference]: Without dead ends: 8190 [2022-03-15 22:23:07,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:23:07,254 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:07,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:23:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8190 states. [2022-03-15 22:23:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8190 to 6722. [2022-03-15 22:23:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6722 states, 6721 states have (on average 4.478053861032585) internal successors, (30097), 6721 states have internal predecessors, (30097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6722 states to 6722 states and 30097 transitions. [2022-03-15 22:23:07,443 INFO L78 Accepts]: Start accepts. Automaton has 6722 states and 30097 transitions. Word has length 18 [2022-03-15 22:23:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:07,443 INFO L470 AbstractCegarLoop]: Abstraction has 6722 states and 30097 transitions. [2022-03-15 22:23:07,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6722 states and 30097 transitions. [2022-03-15 22:23:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:07,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:07,456 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:07,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:07,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:07,656 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2139018705, now seen corresponding path program 110 times [2022-03-15 22:23:07,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:07,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099074496] [2022-03-15 22:23:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:07,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:07,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099074496] [2022-03-15 22:23:07,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099074496] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:07,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897755437] [2022-03-15 22:23:07,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:07,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:07,704 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:07,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-03-15 22:23:07,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:07,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:07,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:07,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:07,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:08,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897755437] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:08,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:08,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2022-03-15 22:23:08,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826902289] [2022-03-15 22:23:08,019 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:08,019 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:08,021 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 45 transitions. [2022-03-15 22:23:08,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:08,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [993146#(or (< k N) (<= (+ N j) (+ M i))), 993144#(<= N i), 993142#(< k N), 993145#(or (<= N i) (< k N)), 993143#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:23:08,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:23:08,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:23:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:23:08,145 INFO L87 Difference]: Start difference. First operand 6722 states and 30097 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:08,707 INFO L93 Difference]: Finished difference Result 7891 states and 33400 transitions. [2022-03-15 22:23:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 22:23:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:08,727 INFO L225 Difference]: With dead ends: 7891 [2022-03-15 22:23:08,727 INFO L226 Difference]: Without dead ends: 7890 [2022-03-15 22:23:08,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=634, Invalid=2558, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:23:08,728 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:08,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2022-03-15 22:23:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 6728. [2022-03-15 22:23:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6728 states, 6727 states have (on average 4.476438233982459) internal successors, (30113), 6727 states have internal predecessors, (30113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 30113 transitions. [2022-03-15 22:23:08,883 INFO L78 Accepts]: Start accepts. Automaton has 6728 states and 30113 transitions. Word has length 18 [2022-03-15 22:23:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:08,883 INFO L470 AbstractCegarLoop]: Abstraction has 6728 states and 30113 transitions. [2022-03-15 22:23:08,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6728 states and 30113 transitions. [2022-03-15 22:23:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:08,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:08,897 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:08,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2022-03-15 22:23:09,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable143 [2022-03-15 22:23:09,097 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1300641937, now seen corresponding path program 111 times [2022-03-15 22:23:09,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:09,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116757128] [2022-03-15 22:23:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:09,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:09,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116757128] [2022-03-15 22:23:09,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116757128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:09,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868890693] [2022-03-15 22:23:09,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:09,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:09,146 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:09,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2022-03-15 22:23:09,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:23:09,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:09,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:09,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:09,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:09,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868890693] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:09,443 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:09,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 21 [2022-03-15 22:23:09,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916773855] [2022-03-15 22:23:09,443 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:09,444 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:09,446 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 50 transitions. [2022-03-15 22:23:09,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:09,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1014678#(or (<= (+ 2 j) M) (< k N)), 1014677#(or (<= (+ 2 j) M) (< k N) (<= M j)), 1014675#(or (<= (+ 2 j) M) (<= M j)), 1014676#(or (< k N) (<= (+ j 1) M)), 1014674#(< k N)] [2022-03-15 22:23:09,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:23:09,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:23:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:23:09,601 INFO L87 Difference]: Start difference. First operand 6728 states and 30113 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:10,108 INFO L93 Difference]: Finished difference Result 7613 states and 32589 transitions. [2022-03-15 22:23:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 22:23:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 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 18 [2022-03-15 22:23:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:10,127 INFO L225 Difference]: With dead ends: 7613 [2022-03-15 22:23:10,127 INFO L226 Difference]: Without dead ends: 7613 [2022-03-15 22:23:10,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=491, Invalid=2059, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:23:10,128 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:10,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7613 states. [2022-03-15 22:23:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7613 to 6686. [2022-03-15 22:23:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6686 states, 6685 states have (on average 4.467314884068811) internal successors, (29864), 6685 states have internal predecessors, (29864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 29864 transitions. [2022-03-15 22:23:10,275 INFO L78 Accepts]: Start accepts. Automaton has 6686 states and 29864 transitions. Word has length 18 [2022-03-15 22:23:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:10,275 INFO L470 AbstractCegarLoop]: Abstraction has 6686 states and 29864 transitions. [2022-03-15 22:23:10,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6686 states and 29864 transitions. [2022-03-15 22:23:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:10,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:10,288 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:10,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:10,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2022-03-15 22:23:10,489 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1342225651, now seen corresponding path program 112 times [2022-03-15 22:23:10,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:10,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187328834] [2022-03-15 22:23:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:10,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:10,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187328834] [2022-03-15 22:23:10,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187328834] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:10,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927100651] [2022-03-15 22:23:10,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:10,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:10,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:10,546 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:10,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2022-03-15 22:23:10,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:10,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:10,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:10,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:10,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927100651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:10,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:10,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2022-03-15 22:23:10,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108538290] [2022-03-15 22:23:10,828 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:10,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:10,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 52 transitions. [2022-03-15 22:23:10,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:11,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1035841#(or (<= N (+ i 1)) (< k N)), 1035839#(<= N (+ i 1)), 1035840#(or (<= N i) (< k N)), 1035836#(< k N), 1035842#(or (< k N) (<= (+ N j) (+ M i))), 1035837#(or (< k N) (<= (+ j 1) M)), 1035843#(or (< k N) (<= (+ N j) (+ M i 1))), 1035838#(<= N i)] [2022-03-15 22:23:11,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:23:11,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:11,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:23:11,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:23:11,011 INFO L87 Difference]: Start difference. First operand 6686 states and 29864 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:11,649 INFO L93 Difference]: Finished difference Result 8309 states and 35121 transitions. [2022-03-15 22:23:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:23:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:11,668 INFO L225 Difference]: With dead ends: 8309 [2022-03-15 22:23:11,669 INFO L226 Difference]: Without dead ends: 8307 [2022-03-15 22:23:11,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=770, Invalid=3136, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 22:23:11,669 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:11,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-03-15 22:23:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 6726. [2022-03-15 22:23:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6726 states, 6725 states have (on average 4.467657992565056) internal successors, (30045), 6725 states have internal predecessors, (30045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6726 states to 6726 states and 30045 transitions. [2022-03-15 22:23:11,820 INFO L78 Accepts]: Start accepts. Automaton has 6726 states and 30045 transitions. Word has length 18 [2022-03-15 22:23:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:11,820 INFO L470 AbstractCegarLoop]: Abstraction has 6726 states and 30045 transitions. [2022-03-15 22:23:11,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6726 states and 30045 transitions. [2022-03-15 22:23:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:11,833 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:11,833 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:11,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2022-03-15 22:23:12,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2022-03-15 22:23:12,033 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 257783501, now seen corresponding path program 113 times [2022-03-15 22:23:12,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:12,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253353685] [2022-03-15 22:23:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:12,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:12,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253353685] [2022-03-15 22:23:12,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253353685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:12,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59436424] [2022-03-15 22:23:12,081 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:12,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:12,082 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:12,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-03-15 22:23:12,168 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:23:12,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:12,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:12,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:12,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:12,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59436424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:12,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:12,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 21 [2022-03-15 22:23:12,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483664523] [2022-03-15 22:23:12,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:12,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:12,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 52 transitions. [2022-03-15 22:23:12,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:12,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1057797#(or (<= (+ 2 j) M) (<= M j)), 1057796#(or (< k N) (<= (+ j 1) M)), 1057798#(or (<= (+ 2 j) M) (< k N) (<= M j)), 1057799#(or (<= (+ 2 j) M) (< k N)), 1057800#(or (<= (+ N j 1) (+ M i)) (< k N)), 1057795#(< k N)] [2022-03-15 22:23:12,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:23:12,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:12,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:23:12,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:23:12,535 INFO L87 Difference]: Start difference. First operand 6726 states and 30045 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:12,971 INFO L93 Difference]: Finished difference Result 7411 states and 32120 transitions. [2022-03-15 22:23:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:23:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:12,991 INFO L225 Difference]: With dead ends: 7411 [2022-03-15 22:23:12,991 INFO L226 Difference]: Without dead ends: 7411 [2022-03-15 22:23:12,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1933, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:23:12,991 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:12,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7411 states. [2022-03-15 22:23:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7411 to 6753. [2022-03-15 22:23:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6752 states have (on average 4.4746741706161135) internal successors, (30213), 6752 states have internal predecessors, (30213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 30213 transitions. [2022-03-15 22:23:13,151 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 30213 transitions. Word has length 18 [2022-03-15 22:23:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:13,151 INFO L470 AbstractCegarLoop]: Abstraction has 6753 states and 30213 transitions. [2022-03-15 22:23:13,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 30213 transitions. [2022-03-15 22:23:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:13,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:13,164 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:13,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:13,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:13,364 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1886618287, now seen corresponding path program 114 times [2022-03-15 22:23:13,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:13,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628755564] [2022-03-15 22:23:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:13,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:13,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628755564] [2022-03-15 22:23:13,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628755564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:13,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530315478] [2022-03-15 22:23:13,411 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:13,412 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:13,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-03-15 22:23:13,498 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:13,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:13,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:13,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:13,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:13,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530315478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:13,691 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:13,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-03-15 22:23:13,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888262419] [2022-03-15 22:23:13,691 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:13,692 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:13,694 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 22:23:13,694 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:13,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [1078890#(or (< k N) (<= (+ j 1) M)), 1078889#(or (<= N (+ i 1)) (< k N)), 1078891#(or (< k N) (<= (+ N j) (+ M i))), 1078885#(<= N i), 1078892#(or (< k N) (<= (+ N j) (+ M i 1))), 1078886#(<= N (+ i 1)), 1078895#(or (<= (+ N j) (+ 2 M i)) (< k N)), 1078887#(< k N), 1078894#(or (<= N (+ 2 i)) (< k N)), 1078888#(or (<= N i) (< k N)), 1078893#(<= N (+ 2 i))] [2022-03-15 22:23:13,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:23:13,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:23:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:23:13,920 INFO L87 Difference]: Start difference. First operand 6753 states and 30213 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:14,602 INFO L93 Difference]: Finished difference Result 9467 states and 39875 transitions. [2022-03-15 22:23:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:23:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:14,629 INFO L225 Difference]: With dead ends: 9467 [2022-03-15 22:23:14,629 INFO L226 Difference]: Without dead ends: 9464 [2022-03-15 22:23:14,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1039, Invalid=4073, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 22:23:14,630 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:14,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9464 states. [2022-03-15 22:23:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9464 to 7227. [2022-03-15 22:23:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7227 states, 7226 states have (on average 4.5350124550235265) internal successors, (32770), 7226 states have internal predecessors, (32770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7227 states to 7227 states and 32770 transitions. [2022-03-15 22:23:14,849 INFO L78 Accepts]: Start accepts. Automaton has 7227 states and 32770 transitions. Word has length 18 [2022-03-15 22:23:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:14,849 INFO L470 AbstractCegarLoop]: Abstraction has 7227 states and 32770 transitions. [2022-03-15 22:23:14,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7227 states and 32770 transitions. [2022-03-15 22:23:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:14,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:14,861 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:14,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2022-03-15 22:23:15,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2022-03-15 22:23:15,062 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash 469025169, now seen corresponding path program 115 times [2022-03-15 22:23:15,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:15,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423228962] [2022-03-15 22:23:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:15,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:15,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423228962] [2022-03-15 22:23:15,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423228962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:15,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369830486] [2022-03-15 22:23:15,116 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:15,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:15,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:15,117 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:15,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-03-15 22:23:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:15,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:15,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:15,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369830486] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:15,397 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:15,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-03-15 22:23:15,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349088490] [2022-03-15 22:23:15,397 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:15,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:15,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 22:23:15,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:15,548 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1103019#(or (< k N) (<= (+ j 1) M)), 1103022#(or (< k N) (<= (+ N j) (+ M i))), 1103020#(<= N i), 1103021#(or (<= N i) (< k N)), 1103018#(< k N), 1103023#(or (<= (+ N j 1) (+ M i)) (< k N))] [2022-03-15 22:23:15,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:23:15,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:23:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:23:15,549 INFO L87 Difference]: Start difference. First operand 7227 states and 32770 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:16,039 INFO L93 Difference]: Finished difference Result 8460 states and 36496 transitions. [2022-03-15 22:23:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:23:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:16,059 INFO L225 Difference]: With dead ends: 8460 [2022-03-15 22:23:16,060 INFO L226 Difference]: Without dead ends: 8459 [2022-03-15 22:23:16,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=608, Invalid=2584, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:23:16,060 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:16,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2022-03-15 22:23:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 7339. [2022-03-15 22:23:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7339 states, 7338 states have (on average 4.532161351866994) internal successors, (33257), 7338 states have internal predecessors, (33257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7339 states to 7339 states and 33257 transitions. [2022-03-15 22:23:16,210 INFO L78 Accepts]: Start accepts. Automaton has 7339 states and 33257 transitions. Word has length 18 [2022-03-15 22:23:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:16,210 INFO L470 AbstractCegarLoop]: Abstraction has 7339 states and 33257 transitions. [2022-03-15 22:23:16,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7339 states and 33257 transitions. [2022-03-15 22:23:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:16,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:16,224 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:16,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:16,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2022-03-15 22:23:16,424 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1324331823, now seen corresponding path program 116 times [2022-03-15 22:23:16,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:16,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218015247] [2022-03-15 22:23:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:16,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:16,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218015247] [2022-03-15 22:23:16,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218015247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:16,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511756938] [2022-03-15 22:23:16,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:16,477 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:16,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-03-15 22:23:16,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:16,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:16,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:16,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:16,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:16,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511756938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:16,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:16,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-03-15 22:23:16,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471896293] [2022-03-15 22:23:16,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:16,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:16,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 22:23:16,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:16,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1126345#(or (< k N) (<= (+ j 1) M)), 1126349#(or (< k N) (<= (+ N j) (+ M i))), 1126343#(or (<= (+ 2 j) M) (<= M j)), 1126347#(or (<= (+ 2 j) M) (< k N)), 1126348#(or (<= (+ N j 1) (+ M i)) (< k N)), 1126344#(< k N), 1126346#(or (<= (+ 2 j) M) (< k N) (<= M j))] [2022-03-15 22:23:16,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:23:16,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:23:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:23:16,992 INFO L87 Difference]: Start difference. First operand 7339 states and 33257 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:17,651 INFO L93 Difference]: Finished difference Result 8398 states and 36494 transitions. [2022-03-15 22:23:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:23:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:17,673 INFO L225 Difference]: With dead ends: 8398 [2022-03-15 22:23:17,673 INFO L226 Difference]: Without dead ends: 8398 [2022-03-15 22:23:17,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=3350, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:23:17,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:17,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2022-03-15 22:23:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 7324. [2022-03-15 22:23:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 7323 states have (on average 4.545268332650553) internal successors, (33285), 7323 states have internal predecessors, (33285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 33285 transitions. [2022-03-15 22:23:17,831 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 33285 transitions. Word has length 18 [2022-03-15 22:23:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:17,831 INFO L470 AbstractCegarLoop]: Abstraction has 7324 states and 33285 transitions. [2022-03-15 22:23:17,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 33285 transitions. [2022-03-15 22:23:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:17,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:17,845 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:17,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2022-03-15 22:23:18,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149,149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:18,045 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1582920819, now seen corresponding path program 117 times [2022-03-15 22:23:18,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:18,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121028029] [2022-03-15 22:23:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:18,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:18,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121028029] [2022-03-15 22:23:18,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121028029] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:18,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388421542] [2022-03-15 22:23:18,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:18,105 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:18,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-03-15 22:23:18,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:23:18,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:18,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:18,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:18,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:18,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388421542] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:18,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:18,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2022-03-15 22:23:18,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232993256] [2022-03-15 22:23:18,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:18,421 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:18,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2022-03-15 22:23:18,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:18,731 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [1149605#(or (< k N) (<= (+ N j) (+ 3 M i))), 1149599#(or (< k N) (<= (+ N j) (+ M i 1))), 1149593#(<= N (+ i 1)), 1149603#(or (<= N (+ 3 i)) (< k N)), 1149602#(or (<= N (+ 2 i)) (< k N)), 1149597#(or (< k N) (<= (+ j 1) M)), 1149596#(or (<= N (+ i 1)) (< k N)), 1149592#(<= N i), 1149595#(or (<= N i) (< k N)), 1149600#(<= N (+ 2 i)), 1149601#(<= N (+ 3 i)), 1149598#(or (< k N) (<= (+ N j) (+ M i))), 1149594#(< k N), 1149604#(or (<= (+ N j) (+ 2 M i)) (< k N))] [2022-03-15 22:23:18,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:23:18,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:23:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:23:18,732 INFO L87 Difference]: Start difference. First operand 7324 states and 33285 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:19,276 INFO L93 Difference]: Finished difference Result 8012 states and 35475 transitions. [2022-03-15 22:23:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:23:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:19,297 INFO L225 Difference]: With dead ends: 8012 [2022-03-15 22:23:19,297 INFO L226 Difference]: Without dead ends: 8008 [2022-03-15 22:23:19,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=821, Invalid=3469, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:23:19,298 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:19,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2022-03-15 22:23:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 7555. [2022-03-15 22:23:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7554 states have (on average 4.530579825258141) internal successors, (34224), 7554 states have internal predecessors, (34224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 34224 transitions. [2022-03-15 22:23:19,468 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 34224 transitions. Word has length 18 [2022-03-15 22:23:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:19,468 INFO L470 AbstractCegarLoop]: Abstraction has 7555 states and 34224 transitions. [2022-03-15 22:23:19,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 34224 transitions. [2022-03-15 22:23:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:19,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:19,483 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:19,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Ended with exit code 0 [2022-03-15 22:23:19,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2022-03-15 22:23:19,683 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -827715217, now seen corresponding path program 118 times [2022-03-15 22:23:19,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:19,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623291961] [2022-03-15 22:23:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:19,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:19,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623291961] [2022-03-15 22:23:19,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623291961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:19,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323124271] [2022-03-15 22:23:19,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:19,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:19,738 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:19,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-03-15 22:23:19,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:19,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:19,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:19,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:19,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:20,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323124271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:20,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:20,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2022-03-15 22:23:20,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2081486961] [2022-03-15 22:23:20,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:20,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:20,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 51 transitions. [2022-03-15 22:23:20,066 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:20,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1172907#(< k N), 1172911#(or (< k N) (<= (+ N j) (+ M i))), 1172912#(or (<= (+ N j 1) (+ M i)) (< k N)), 1172908#(or (< k N) (<= (+ j 1) M)), 1172909#(<= N i), 1172910#(or (<= N i) (< k N)), 1172913#(or (< k N) (<= (+ N j) (+ M i 1)))] [2022-03-15 22:23:20,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:23:20,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:23:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:23:20,250 INFO L87 Difference]: Start difference. First operand 7555 states and 34224 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:20,593 INFO L93 Difference]: Finished difference Result 7915 states and 35211 transitions. [2022-03-15 22:23:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:23:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:20,613 INFO L225 Difference]: With dead ends: 7915 [2022-03-15 22:23:20,614 INFO L226 Difference]: Without dead ends: 7914 [2022-03-15 22:23:20,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:23:20,614 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:20,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:23:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-03-15 22:23:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 7566. [2022-03-15 22:23:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7566 states, 7565 states have (on average 4.530072703238599) internal successors, (34270), 7565 states have internal predecessors, (34270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 34270 transitions. [2022-03-15 22:23:20,770 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 34270 transitions. Word has length 18 [2022-03-15 22:23:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:20,770 INFO L470 AbstractCegarLoop]: Abstraction has 7566 states and 34270 transitions. [2022-03-15 22:23:20,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 34270 transitions. [2022-03-15 22:23:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:20,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:20,786 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:20,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Ended with exit code 0 [2022-03-15 22:23:20,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,151 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:20,986 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 27591437, now seen corresponding path program 119 times [2022-03-15 22:23:20,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:20,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386317006] [2022-03-15 22:23:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:21,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386317006] [2022-03-15 22:23:21,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386317006] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:21,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10908806] [2022-03-15 22:23:21,045 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:21,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:21,046 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:21,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2022-03-15 22:23:21,138 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:23:21,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:21,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:21,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10908806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:21,421 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:21,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 22:23:21,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241138580] [2022-03-15 22:23:21,422 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:21,422 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:21,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 22:23:21,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:21,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1196122#(or (< k N) (<= (+ N j) (+ M i))), 1196117#(or (< k N) (<= (+ j 1) M)), 1196123#(or (< k N) (<= (+ N j) (+ M i 1))), 1196120#(or (<= (+ 2 j) M) (< k N)), 1196121#(or (<= (+ N j 1) (+ M i)) (< k N)), 1196116#(< k N), 1196119#(or (<= (+ 2 j) M) (< k N) (<= M j)), 1196118#(or (<= (+ 2 j) M) (<= M j))] [2022-03-15 22:23:21,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:23:21,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:23:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:23:21,672 INFO L87 Difference]: Start difference. First operand 7566 states and 34270 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:22,105 INFO L93 Difference]: Finished difference Result 7824 states and 34948 transitions. [2022-03-15 22:23:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:23:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:23:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:22,125 INFO L225 Difference]: With dead ends: 7824 [2022-03-15 22:23:22,125 INFO L226 Difference]: Without dead ends: 7824 [2022-03-15 22:23:22,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:23:22,126 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:22,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2022-03-15 22:23:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7560. [2022-03-15 22:23:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7560 states, 7559 states have (on average 4.529831988358248) internal successors, (34241), 7559 states have internal predecessors, (34241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 34241 transitions. [2022-03-15 22:23:22,268 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 34241 transitions. Word has length 18 [2022-03-15 22:23:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:22,269 INFO L470 AbstractCegarLoop]: Abstraction has 7560 states and 34241 transitions. [2022-03-15 22:23:22,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 34241 transitions. [2022-03-15 22:23:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:23:22,283 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:22,283 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:22,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Ended with exit code 0 [2022-03-15 22:23:22,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,152 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:22,483 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1145130961, now seen corresponding path program 120 times [2022-03-15 22:23:22,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:22,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943334932] [2022-03-15 22:23:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:22,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:22,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943334932] [2022-03-15 22:23:22,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943334932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:22,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376783948] [2022-03-15 22:23:22,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:22,557 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:22,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2022-03-15 22:23:22,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:22,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:22,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:23:22,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:22,729 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 8 treesize of output 7 [2022-03-15 22:23:22,762 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:23:22,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:23:22,854 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-03-15 22:23:22,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:23:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 22:23:22,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:23,103 INFO L353 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-03-15 22:23:23,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 48 [2022-03-15 22:23:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 22:23:23,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376783948] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:23,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:23,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-03-15 22:23:23,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418982411] [2022-03-15 22:23:23,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:23,285 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:23,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 81 transitions. [2022-03-15 22:23:23,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:23,825 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [1219237#(and (or (<= N (+ i 1)) (<= (+ 5 j) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1219247#(or (<= (+ 3 j) M) (< i N)), 1219238#(and (or (<= N (+ 2 i)) (<= (+ 5 j) N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1219248#(or (<= (+ 3 k j) (+ N M)) (< i N)), 1219246#(or (<= (+ 2 j) M) (< k N) (< i N)), 1219236#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 5 j) N))), 1219245#(or (<= (+ 2 j) M) (< i N)), 1219241#(< k N), 1219240#(and (or (<= N (+ i 4)) (<= (+ 5 j) N)) (or (= (+ (* (- 1) k) M) 0) (<= N (+ i 4)))), 1219239#(and (or (<= N (+ 3 i)) (<= (+ 5 j) N)) (or (= (+ (* (- 1) k) M) 0) (<= N (+ 3 i)))), 1219242#(or (<= (+ 2 j) M) (< k N)), 1219249#(or (<= (+ k j 4) (+ N M)) (< i N)), 1219244#(or (< k N) (< i N)), 1219243#(< i N)] [2022-03-15 22:23:23,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:23:23,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:23,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:23:23,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:23:23,826 INFO L87 Difference]: Start difference. First operand 7560 states and 34241 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:24,821 INFO L93 Difference]: Finished difference Result 9752 states and 42444 transitions. [2022-03-15 22:23:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 22:23:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:23:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:24,846 INFO L225 Difference]: With dead ends: 9752 [2022-03-15 22:23:24,846 INFO L226 Difference]: Without dead ends: 9752 [2022-03-15 22:23:24,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=848, Invalid=3982, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:23:24,847 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:23:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9752 states. [2022-03-15 22:23:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9752 to 7796. [2022-03-15 22:23:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7796 states, 7795 states have (on average 4.546632456703015) internal successors, (35441), 7795 states have internal predecessors, (35441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 35441 transitions. [2022-03-15 22:23:25,018 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 35441 transitions. Word has length 19 [2022-03-15 22:23:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:25,018 INFO L470 AbstractCegarLoop]: Abstraction has 7796 states and 35441 transitions. [2022-03-15 22:23:25,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 35441 transitions. [2022-03-15 22:23:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:23:25,033 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:25,033 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:25,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Forceful destruction successful, exit code 0 [2022-03-15 22:23:25,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,153 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:25,234 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 33572779, now seen corresponding path program 121 times [2022-03-15 22:23:25,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:25,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810733450] [2022-03-15 22:23:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:25,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:25,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810733450] [2022-03-15 22:23:25,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810733450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:25,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428533089] [2022-03-15 22:23:25,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:25,306 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:25,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2022-03-15 22:23:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:25,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:23:25,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:25,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:25,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428533089] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:25,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:25,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2022-03-15 22:23:25,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1023342883] [2022-03-15 22:23:25,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:25,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:25,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 22:23:25,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:26,013 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1244802#(or (< k N) (< i N)), 1244799#(or (<= (+ 3 j) M) (< i N)), 1244800#(and (or (<= N (+ 2 i)) (<= (+ j 1) i)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1244803#(or (<= (+ 2 j) M) (< k N) (< i N)), 1244795#(and (or (<= N (+ i 1)) (<= (+ 2 j) i)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1244794#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 3 j) i))), 1244751#(or (<= (+ 2 j) M) (< k N)), 1244801#(and (or (<= j i) (<= N (+ 3 i))) (or (= (+ (* (- 1) k) M) 0) (<= N (+ 3 i)))), 1244796#(< k N), 1244797#(< i N), 1244798#(or (<= (+ 2 j) M) (< i N)), 1244804#(or (<= (+ 3 k j) (+ N M)) (< i N))] [2022-03-15 22:23:26,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:23:26,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:23:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:23:26,014 INFO L87 Difference]: Start difference. First operand 7796 states and 35441 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:27,042 INFO L93 Difference]: Finished difference Result 9647 states and 41767 transitions. [2022-03-15 22:23:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:23:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:23:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:27,067 INFO L225 Difference]: With dead ends: 9647 [2022-03-15 22:23:27,068 INFO L226 Difference]: Without dead ends: 9647 [2022-03-15 22:23:27,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=4896, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 22:23:27,068 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:27,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:23:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2022-03-15 22:23:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 7857. [2022-03-15 22:23:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7857 states, 7856 states have (on average 4.55091649694501) internal successors, (35752), 7856 states have internal predecessors, (35752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 35752 transitions. [2022-03-15 22:23:27,245 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 35752 transitions. Word has length 19 [2022-03-15 22:23:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:27,245 INFO L470 AbstractCegarLoop]: Abstraction has 7857 states and 35752 transitions. [2022-03-15 22:23:27,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 35752 transitions. [2022-03-15 22:23:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:23:27,260 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:27,260 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:27,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Ended with exit code 0 [2022-03-15 22:23:27,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,154 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:27,461 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1843457098, now seen corresponding path program 122 times [2022-03-15 22:23:27,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:27,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309180563] [2022-03-15 22:23:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:27,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:27,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309180563] [2022-03-15 22:23:27,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309180563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:27,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342712235] [2022-03-15 22:23:27,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:27,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:27,958 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:27,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2022-03-15 22:23:28,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:28,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:28,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:23:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:28,129 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 22:23:28,153 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 16 treesize of output 18 [2022-03-15 22:23:28,198 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:23:28,198 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:23:28,303 INFO L353 Elim1Store]: treesize reduction 64, result has 20.0 percent of original size [2022-03-15 22:23:28,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:23:28,433 INFO L353 Elim1Store]: treesize reduction 104, result has 16.8 percent of original size [2022-03-15 22:23:28,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 48 [2022-03-15 22:23:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:23:28,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:28,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:28,783 INFO L353 Elim1Store]: treesize reduction 20, result has 74.7 percent of original size [2022-03-15 22:23:28,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 78 [2022-03-15 22:23:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 22:23:28,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342712235] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:28,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:28,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 25 [2022-03-15 22:23:28,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656533645] [2022-03-15 22:23:28,960 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:28,961 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:28,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2022-03-15 22:23:28,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:30,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1270380#(or (= (select A l) (select B l)) (< j M) (< k N)), 1270340#(or (= (select A l) (select B l)) (< k N)), 1270384#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (not (= l k)) (= l i)) (or (= (select A l) (select B l)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (= l i) (= l j))), 1270381#(or (= (select A l) (select B l)) (< j M) (= l i)), 1270387#(and (or (<= (+ 2 k) N) (not (< i N)) (< (+ 3 j) M) (not (< (+ 2 j) M)) (not (= l k)) (= (+ i 1) l)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 2 k) N) (not (< i N)) (< (+ 3 j) M) (not (< (+ 2 j) M)) (= (+ 2 j) l) (= l i) (= l j) (= (+ i 1) l))), 1270388#(and (or (= 2 l) (<= N i) (not (= (+ (- 1) M (* (- 1) i)) 0)) (not (= k 1)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N i) (not (<= M i)) (<= i 2)) (or (<= M (+ i 1)) (<= 2 i) (<= N i)) (or (= l 1) (= 2 l) (<= N i) (not (= (+ (- 1) M (* (- 1) i)) 0)) (<= 3 l) (not (= k j)) (< M (+ l 1))) (or (= l 1) (= 2 l) (<= N i) (not (= (+ (- 1) M (* (- 1) i)) 0)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (<= N i) (<= l M) (not (= (+ (- 1) M (* (- 1) i)) 0))) (or (= (+ (* (- 1) k) M) 0) (<= N i) (<= l M) (not (= (+ (- 1) M (* (- 1) i)) 0))) (or (= l 1) (<= N i) (not (= (+ (- 1) M (* (- 1) i)) 0)) (not (= 2 k)) (= l j) (<= 3 l) (< M (+ l 1)))), 1270392#(and (or (<= (+ l 1) N) (<= N (+ 2 i)) (not (= (+ M (- 3) (* (- 1) i)) 0)) (<= l M)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0) (not (= (+ M (- 3) (* (- 1) i)) 0)) (<= l M)) (or (<= N (+ 2 i)) (not (= (+ M (- 3) (* (- 1) i)) 0)) (= 2 l) (not (= k 1)) (= l j) (<= 3 l) (< M (+ l 1))) (or (= l 1) (<= N (+ 2 i)) (not (= (+ M (- 3) (* (- 1) i)) 0)) (= 2 l) (<= 3 l) (not (= k j)) (< M (+ l 1))) (or (= l 1) (<= N (+ 2 i)) (not (= (+ M (- 3) (* (- 1) i)) 0)) (not (= 2 k)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i) (<= M (+ 3 i))) (or (<= N (+ 2 i)) (not (<= M (+ 2 i))) (<= i 0)) (or (= l 1) (<= N (+ 2 i)) (not (= (+ M (- 3) (* (- 1) i)) 0)) (= 2 l) (= l j) (<= 3 l) (< M (+ l 1)))), 1270383#(and (or (= (select A l) (select B l)) (<= (+ 2 k) N) (< j M) (= l i)) (or (<= (+ 2 k) N) (< j M) (not (= l k)) (= l i))), 1270382#(or (= (select A l) (select B l)) (< j M) (< k N) (= l i)), 1270391#(and (or (<= N (+ i 1)) (<= M (+ 2 i)) (<= 1 i)) (or (<= N (+ i 1)) (= l 1) (= 2 l) (not (= (+ (- 2) M (* (- 1) i)) 0)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= l 1) (= 2 l) (not (= (+ (- 2) M (* (- 1) i)) 0)) (<= 3 l) (not (= k j)) (< M (+ l 1))) (or (<= N (+ i 1)) (= l 1) (not (= (+ (- 2) M (* (- 1) i)) 0)) (not (= 2 k)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (<= l M) (not (= (+ (- 2) M (* (- 1) i)) 0))) (or (<= N (+ i 1)) (= 2 l) (not (= (+ (- 2) M (* (- 1) i)) 0)) (not (= k 1)) (= l j) (<= 3 l) (< M (+ l 1))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= i 1) (not (<= M (+ i 1)))) (or (<= N (+ i 1)) (<= (+ l 1) N) (<= l M) (not (= (+ (- 2) M (* (- 1) i)) 0)))), 1270390#(and (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 j) M) (not (< (+ 2 j) M)) (= l (+ 2 i)) (= (+ 2 j) l) (= (+ 3 i) l) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 j) M) (not (< (+ 2 j) M)) (not (= l k)) (= (+ 3 i) l))), 1270385#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 2 j) M) (= l i) (= l j)) (or (not (< (+ j 1) M)) (<= (+ 2 k) N) (< (+ 2 j) M) (not (= l k)) (= l i))), 1270389#(and (or (= (select A l) (select B l)) (not (< (+ i 1) N)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 3 j) M) (not (< (+ 2 j) M)) (= l (+ 2 i)) (= (+ 2 j) l) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ i 1) N)) (<= (+ 2 k) N) (< (+ 3 j) M) (not (< (+ 2 j) M)) (= l (+ 2 i)) (not (= l k)))), 1270386#(and (or (<= (+ 2 k) N) (< (+ 3 j) M) (not (< (+ 2 j) M)) (not (= l k)) (= l i)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 2 k) N) (< (+ 3 j) M) (not (< (+ 2 j) M)) (= (+ 2 j) l) (= l i) (= l j))), 1270379#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:23:30,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:30,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1440, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:23:30,775 INFO L87 Difference]: Start difference. First operand 7857 states and 35752 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:49,328 INFO L93 Difference]: Finished difference Result 10279 states and 42665 transitions. [2022-03-15 22:23:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:23:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:23:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:49,359 INFO L225 Difference]: With dead ends: 10279 [2022-03-15 22:23:49,360 INFO L226 Difference]: Without dead ends: 10253 [2022-03-15 22:23:49,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4539 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=2109, Invalid=13641, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 22:23:49,360 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:49,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:23:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10253 states. [2022-03-15 22:23:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10253 to 7875. [2022-03-15 22:23:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7875 states, 7874 states have (on average 4.550673101346202) internal successors, (35832), 7874 states have internal predecessors, (35832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 35832 transitions. [2022-03-15 22:23:49,531 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 35832 transitions. Word has length 19 [2022-03-15 22:23:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:49,532 INFO L470 AbstractCegarLoop]: Abstraction has 7875 states and 35832 transitions. [2022-03-15 22:23:49,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 35832 transitions. [2022-03-15 22:23:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:23:49,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:49,547 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:49,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Ended with exit code 0 [2022-03-15 22:23:49,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155,155 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:49,747 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1645003692, now seen corresponding path program 123 times [2022-03-15 22:23:49,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:49,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758351430] [2022-03-15 22:23:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:50,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:50,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758351430] [2022-03-15 22:23:50,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758351430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:50,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615509232] [2022-03-15 22:23:50,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:50,227 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:23:50,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2022-03-15 22:23:50,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:23:50,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:50,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 22:23:50,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:50,433 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 8 treesize of output 7 [2022-03-15 22:23:50,462 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 16 treesize of output 18 [2022-03-15 22:23:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,546 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 27 treesize of output 32 [2022-03-15 22:23:50,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-03-15 22:23:50,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:50,688 INFO L353 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2022-03-15 22:23:50,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 52 [2022-03-15 22:23:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:50,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:51,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:51,107 INFO L353 Elim1Store]: treesize reduction 39, result has 70.2 percent of original size [2022-03-15 22:23:51,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 116 [2022-03-15 22:23:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:51,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615509232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:51,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:51,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:23:51,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936584542] [2022-03-15 22:23:51,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:51,432 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:51,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2022-03-15 22:23:51,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:52,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1296745#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (not (< (+ i 1) N)) (= (+ j 1) l) (< (+ 2 j) M) (= l i) (= l j) (<= (+ k 1) l)) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 j) M) (<= k (+ i 1)))), 1296736#(or (= (select A l) (select B l)) (< j M) (< k N)), 1296744#(and (or (<= (+ l 1) N) (not (< i N))) (or (not (< i N)) (= j 0)) (or (<= 2 i) (not (< i N))) (or (= (select A l) (select B l)) (= l 0) (not (< i N)) (<= 2 l) (< M (+ l 1))) (or (not (< i N)) (= M k))), 1296741#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (not (< j M)) (= l j) (<= (+ k 1) l)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< j M)))), 1296746#(and (or (<= (+ l 1) N) (not (< (+ i 1) N))) (or (= (select A l) (select B l)) (not (< (+ i 1) N)) (= l 0) (<= 2 l) (= l i) (< M (+ l 1))) (or (not (< (+ i 1) N)) (= M k)) (or (not (< (+ i 1) N)) (= j 0)) (or (not (< (+ i 1) N)) (<= 1 i))), 1296739#(and (or (<= (+ l 1) N) (< j M) (<= l k) (not (= k i))) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (not (= k i))) (or (< j M) (< k (+ i 1)))), 1296735#(or (= (select A l) (select B l)) (< j M)), 1296740#(and (or (<= (+ l 1) N) (< j M)) (or (= (select A l) (select B l)) (= l k) (< j M) (<= (+ k 1) l)) (or (< j M) (<= (+ k 1) i))), 1296742#(and (or (<= (+ l 1) N) (not (< (+ j 1) M)) (< (+ 2 j) M)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (< (+ 2 j) M) (= l j) (<= (+ k 1) l)) (or (not (< (+ j 1) M)) (<= (+ k 1) i) (< (+ 2 j) M))), 1296738#(or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)), 1296748#(and (or (= (select A l) (select B l)) (not (< (+ 2 i) N)) (= l 0) (<= 2 l) (= l i) (= (+ i 1) l) (< M (+ l 1))) (or (<= 0 i) (not (< (+ 2 i) N))) (or (not (< (+ 2 i) N)) (= j 0)) (or (not (< (+ 2 i) N)) (= M k)) (or (<= (+ l 1) N) (not (< (+ 2 i) N)))), 1296734#(or (= (select A l) (select B l)) (< k N)), 1296737#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 1296743#(and (or (<= (+ l 1) N) (not (< (+ j 1) M)) (not (< i N)) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= k i) (not (< i N)) (< (+ 2 j) M)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (not (< i N)) (< (+ 2 j) M) (= l j) (<= (+ k 1) l))), 1296747#(and (or (not (< (+ j 1) M)) (not (< (+ 2 i) N)) (<= k (+ 2 i)) (< (+ 2 j) M)) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (not (< (+ 2 i) N)) (< (+ 2 j) M)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= l k) (= (+ j 1) l) (not (< (+ 2 i) N)) (< (+ 2 j) M) (= l i) (= l j) (<= (+ k 1) l) (= (+ i 1) l)))] [2022-03-15 22:23:52,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:52,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2036, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:23:52,961 INFO L87 Difference]: Start difference. First operand 7875 states and 35832 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:09,397 INFO L93 Difference]: Finished difference Result 13102 states and 54284 transitions. [2022-03-15 22:24:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-03-15 22:24:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:24:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:09,432 INFO L225 Difference]: With dead ends: 13102 [2022-03-15 22:24:09,432 INFO L226 Difference]: Without dead ends: 12998 [2022-03-15 22:24:09,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18424 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=8339, Invalid=44791, Unknown=0, NotChecked=0, Total=53130 [2022-03-15 22:24:09,434 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 577 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:09,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 0 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:24:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12998 states. [2022-03-15 22:24:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12998 to 8646. [2022-03-15 22:24:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8646 states, 8645 states have (on average 4.597339502602661) internal successors, (39744), 8645 states have internal predecessors, (39744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8646 states to 8646 states and 39744 transitions. [2022-03-15 22:24:09,666 INFO L78 Accepts]: Start accepts. Automaton has 8646 states and 39744 transitions. Word has length 19 [2022-03-15 22:24:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:09,666 INFO L470 AbstractCegarLoop]: Abstraction has 8646 states and 39744 transitions. [2022-03-15 22:24:09,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8646 states and 39744 transitions. [2022-03-15 22:24:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:09,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:09,683 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:09,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Ended with exit code 0 [2022-03-15 22:24:09,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 156 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2022-03-15 22:24:09,883 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1987530792, now seen corresponding path program 124 times [2022-03-15 22:24:09,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:09,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397451987] [2022-03-15 22:24:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:10,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:10,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397451987] [2022-03-15 22:24:10,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397451987] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:10,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15440763] [2022-03-15 22:24:10,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:24:10,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:10,424 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:10,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2022-03-15 22:24:10,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:24:10,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:10,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 22:24:10,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:10,630 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 22:24:10,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:10,664 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 22:24:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:10,735 INFO L353 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2022-03-15 22:24:10,736 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-03-15 22:24:10,836 INFO L353 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2022-03-15 22:24:10,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:24:10,887 INFO L353 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2022-03-15 22:24:10,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 48 [2022-03-15 22:24:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:11,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:11,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:11,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:11,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:11,265 INFO L353 Elim1Store]: treesize reduction 25, result has 77.1 percent of original size [2022-03-15 22:24:11,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 40 treesize of output 108 [2022-03-15 22:24:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:11,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15440763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:11,488 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:11,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2022-03-15 22:24:11,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895219932] [2022-03-15 22:24:11,489 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:11,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:11,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 22:24:11,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:13,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1327653#(or (= (select A l) (select B l)) (< k N)), 1327662#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (<= (+ j 1) i) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l (+ 2 i)) (= l i) (= (+ i 1) l) (< M (+ l 1))) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (<= (+ j 1) i) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M)) (or (not (< (+ j 1) M)) (not (< (+ 2 i) N)) (= M k)) (or (<= M (+ 3 i)) (not (< (+ 2 i) N)) (<= j i) (<= M (+ j 1)))), 1327655#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 1327658#(and (or (<= j i) (< k N) (<= (+ N j) (+ M i)) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (< k N) (<= (+ N j) (+ M i)) (<= j l) (< M (+ l 1))) (or (not (<= (+ M 1) i)) (< k N) (<= N (+ M 1)) (<= (+ N j) (+ M i))) (or (not (= M i)) (<= l M) (< k N) (<= (+ N j) (+ M i)))), 1327652#(and (or (<= M (+ i 1)) (<= (+ 2 j) i) (not (< i N)) (<= M (+ j 1))) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (<= (+ 3 j) i) (<= l M) (not (< i N)) (not (= (+ i 1) M))) (or (not (< (+ j 1) M)) (not (< i N)) (= M k)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= (+ j 1) l) (<= (+ 3 j) i) (not (< i N)) (not (= (+ i 1) M)) (= l i) (= l j) (< M (+ l 1)))), 1327661#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (not (= M (+ 2 i))) (= (+ l 1) (+ 2 i)) (< 1 i) (= (+ 2 l) (+ 2 i)) (= l j) (< M (+ l 1))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= (+ l 1) N) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M))), 1327650#(and (or (<= (+ 2 j) i) (<= M j) (<= M i)) (or (not (< j M)) (= M k)) (or (<= (+ l 1) N) (not (= M i)) (<= (+ 3 j) i) (<= l M) (not (< j M))) (or (= (select A l) (select B l)) (not (= M i)) (= (+ j 1) l) (<= (+ 3 j) i) (not (< j M)) (= l j) (< M (+ l 1)))), 1327659#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (= l i) (= l j) (= (+ i 1) l) (< M (+ l 1))) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (= M k)) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (<= M (+ 2 i)) (<= M (+ j 1)))), 1327654#(or (= (select A l) (select B l)) (<= N i) (= l i)), 1327660#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< 2 i) (<= N i) (not (= (+ i 1) M)) (= (+ i 1) (+ 2 l)) (= (+ l 1) (+ i 1)) (= l j) (< M (+ l 1))) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (<= (+ 3 j) i) (<= l M) (not (< i N)) (not (= (+ i 1) M)))), 1327651#(and (or (<= (+ 3 j) i) (<= M (+ j 1)) (<= M i)) (or (<= (+ l 1) N) (not (< (+ j 1) M)) (not (= M i)) (<= (+ j 4) i) (<= l M)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (not (= M i)) (= (+ j 1) l) (<= (+ j 4) i) (= (+ 2 j) l) (= l j) (< M (+ l 1))) (or (not (< (+ j 1) M)) (= M k))), 1327604#(or (= (select A l) (select B l)) (< j M)), 1327663#(and (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (< 0 i) (<= N (+ 2 i)) (= (+ 2 l) (+ 3 i)) (not (= (+ 3 i) M)) (= (+ l 1) (+ 3 i)) (= l j) (< M (+ l 1))) (or (<= (+ l 1) N) (<= (+ j 1) i) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1327656#(or (= (select A l) (select B l)) (< j M) (< k N)), 1327657#(and (or (<= l M) (< k N) (<= (+ j 1) M)) (or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M)))] [2022-03-15 22:24:13,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:24:13,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:24:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2043, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:24:13,177 INFO L87 Difference]: Start difference. First operand 8646 states and 39744 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:25,277 INFO L93 Difference]: Finished difference Result 11271 states and 48522 transitions. [2022-03-15 22:24:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 22:24:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:24:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:25,306 INFO L225 Difference]: With dead ends: 11271 [2022-03-15 22:24:25,306 INFO L226 Difference]: Without dead ends: 11259 [2022-03-15 22:24:25,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6944 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3102, Invalid=19548, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 22:24:25,307 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 514 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:25,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 0 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:24:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11259 states. [2022-03-15 22:24:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11259 to 8867. [2022-03-15 22:24:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8867 states, 8866 states have (on average 4.606586961425671) internal successors, (40842), 8866 states have internal predecessors, (40842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 40842 transitions. [2022-03-15 22:24:25,499 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 40842 transitions. Word has length 19 [2022-03-15 22:24:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:25,499 INFO L470 AbstractCegarLoop]: Abstraction has 8867 states and 40842 transitions. [2022-03-15 22:24:25,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 40842 transitions. [2022-03-15 22:24:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:25,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:25,516 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:25,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:25,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 157 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2022-03-15 22:24:25,716 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1132224138, now seen corresponding path program 125 times [2022-03-15 22:24:25,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:25,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530871454] [2022-03-15 22:24:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:26,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:26,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530871454] [2022-03-15 22:24:26,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530871454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:26,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420256701] [2022-03-15 22:24:26,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:24:26,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:26,279 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:26,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2022-03-15 22:24:26,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:24:26,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:26,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 22:24:26,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:26,499 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 22:24:26,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,527 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 22:24:26,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,591 INFO L353 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2022-03-15 22:24:26,591 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-03-15 22:24:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,688 INFO L353 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2022-03-15 22:24:26,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2022-03-15 22:24:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:26,747 INFO L353 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-03-15 22:24:26,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 60 [2022-03-15 22:24:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:27,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:27,215 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 2578 treesize of output 2570 [2022-03-15 22:24:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:27,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420256701] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:27,592 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:27,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 22:24:27,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453955004] [2022-03-15 22:24:27,593 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:27,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:27,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 67 transitions. [2022-03-15 22:24:27,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:29,286 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1357014#(and (or (<= (+ l 1) N) (not (= M i)) (<= (+ 3 j) i) (<= l M) (<= M j)) (or (not (< j M)) (= M k)) (or (<= (+ 2 j) i) (= (+ j 1) l) (<= M j) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ 3 j) i) (not (< j M)) (= l j))), 1357023#(and (or (< 2 i) (<= N i) (= l 0) (not (= (+ i 1) M)) (= (+ i 1) (+ 2 l)) (= l i) (<= 3 l)) (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (<= l M) (not (= (+ i 1) M)))), 1357020#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 1357018#(or (= (select A l) (select B l)) (< j M) (< k N)), 1357016#(and (or (<= (+ l 1) N) (<= (+ 3 j) i) (<= l M) (not (< i N)) (not (= (+ i 1) M)) (<= M (+ j 1))) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= M l) (= (+ j 1) l) (not (<= l M)) (<= (+ 3 j) i) (not (< i N)) (not (= (+ i 1) M)) (= l i) (= l j)) (or (<= M (+ i 1)) (<= (+ 2 j) i) (not (< i N)) (<= M (+ j 1)) (= (+ 2 j) l)) (or (not (< (+ j 1) M)) (not (< i N)) (= M k))), 1357026#(and (or (<= N (+ 2 i)) (= j 0)) (or (< 0 i) (<= N (+ 2 i)) (= (+ 2 l) (+ 3 i)) (not (= (+ 3 i) M)) (= l 0) (= l (+ 2 i)) (<= 3 l)) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= (+ l 1) N) (<= (+ j 1) i) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1357021#(and (or (<= (+ 2 j) M) (<= l M) (< k N) (= l j)) (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j))), 1357019#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 1357015#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (not (= M i)) (= M l) (= (+ j 1) l) (<= (+ j 4) i) (not (<= l M)) (= (+ 2 j) l) (= l j)) (or (<= (+ l 1) N) (not (= M i)) (<= (+ j 4) i) (<= l M) (<= M (+ j 1))) (or (<= (+ 3 j) i) (<= M (+ j 1)) (= (+ 2 j) l) (<= M i)) (or (not (< (+ j 1) M)) (= M k))), 1357024#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M (+ 2 i))) (<= l M) (< 1 i)) (or (<= N (+ i 1)) (not (= M (+ 2 i))) (= l 0) (< 1 i) (= (+ 2 l) (+ 2 i)) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1357022#(and (or (not (< (+ i 1) N)) (<= (+ j 1) i) (<= M (+ 2 i)) (<= M (+ j 1)) (= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M) (<= M (+ j 1))) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (= M k)) (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (= M l) (not (= M (+ 2 i))) (not (<= l M)) (= l i) (= l j) (= (+ i 1) l))), 1357025#(and (or (= (select A l) (select B l)) (not (< (+ j 1) M)) (= M l) (<= (+ j 1) i) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l (+ 2 i)) (= l i) (= (+ i 1) l)) (or (not (< (+ j 1) M)) (not (< (+ 2 i) N)) (= M k)) (or (<= M (+ 3 i)) (not (< (+ 2 i) N)) (<= j i) (<= M (+ j 1)) (= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ j 1) i) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M) (<= M (+ j 1)))), 1357017#(or (= (select A l) (select B l)) (< k N))] [2022-03-15 22:24:29,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:24:29,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:24:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:24:29,286 INFO L87 Difference]: Start difference. First operand 8867 states and 40842 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:41,502 INFO L93 Difference]: Finished difference Result 11207 states and 48488 transitions. [2022-03-15 22:24:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 22:24:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:24:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:41,531 INFO L225 Difference]: With dead ends: 11207 [2022-03-15 22:24:41,532 INFO L226 Difference]: Without dead ends: 11191 [2022-03-15 22:24:41,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6520 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3040, Invalid=17552, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 22:24:41,533 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:41,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:24:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2022-03-15 22:24:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 9047. [2022-03-15 22:24:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9047 states, 9046 states have (on average 4.61574176431572) internal successors, (41754), 9046 states have internal predecessors, (41754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 41754 transitions. [2022-03-15 22:24:41,738 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 41754 transitions. Word has length 19 [2022-03-15 22:24:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:41,738 INFO L470 AbstractCegarLoop]: Abstraction has 9047 states and 41754 transitions. [2022-03-15 22:24:41,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 41754 transitions. [2022-03-15 22:24:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:41,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:41,755 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:41,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2022-03-15 22:24:41,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2022-03-15 22:24:41,956 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1881861514, now seen corresponding path program 126 times [2022-03-15 22:24:41,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:41,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428235693] [2022-03-15 22:24:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:42,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:42,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428235693] [2022-03-15 22:24:42,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428235693] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:42,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857027531] [2022-03-15 22:24:42,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:24:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:42,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:42,340 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:24:42,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2022-03-15 22:24:42,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:24:42,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:42,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:24:42,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:42,546 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 8 treesize of output 7 [2022-03-15 22:24:42,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,589 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 20 treesize of output 22 [2022-03-15 22:24:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,622 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 31 treesize of output 36 [2022-03-15 22:24:42,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2022-03-15 22:24:42,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:42,756 INFO L353 Elim1Store]: treesize reduction 76, result has 24.8 percent of original size [2022-03-15 22:24:42,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 56 [2022-03-15 22:24:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:42,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:43,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:43,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:43,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:43,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:43,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:43,166 INFO L353 Elim1Store]: treesize reduction 25, result has 72.5 percent of original size [2022-03-15 22:24:43,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 90 [2022-03-15 22:24:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:43,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857027531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:43,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:43,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 22:24:43,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502203564] [2022-03-15 22:24:43,448 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:43,449 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:43,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2022-03-15 22:24:43,453 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:45,164 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1386664#(or (= (select A l) (select B l)) (< k N)), 1386669#(and (or (<= (+ l 1) N) (< j M) (<= l k) (< k i)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (< k i)) (or (< j M) (< k (+ i 1)))), 1386678#(and (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i))) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (< 0 i) (<= N (+ 2 i)) (= M l) (not (<= l M)) (= l 0) (not (<= l 0))) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1386665#(or (= (select A l) (select B l)) (< j M)), 1386677#(and (or (< (+ j 1) M) (= l k) (not (< (+ 2 i) N)) (< k (+ i 1)) (= l 0) (not (< j M)) (= l (+ 2 i)) (<= (+ 2 k) l)) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< (+ 2 i) N)) (< k (+ i 1)) (not (< j M)) (= l (+ 2 i)) (<= (+ 2 k) l) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (not (< (+ 2 i) N)) (not (< j M)) (<= k (+ i 1))) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< (+ 2 i) N)) (< k (+ i 1)) (not (< j M)))), 1386668#(or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)), 1386671#(and (or (= (select A l) (select B l)) (= l k) (< j M) (= (+ (- 1) i) l) (< (+ 2 k) i) (<= (+ 2 k) l)) (or (<= (+ 2 k) i) (< j M)) (or (<= (+ l 1) N) (< j M) (< (+ 2 k) i)) (or (= l k) (< j M) (= l 0) (= (+ (- 1) i) l) (< (+ 2 k) i) (<= (+ 2 k) l))), 1386666#(or (= (select A l) (select B l)) (< j M) (< k N)), 1386674#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (<= k i) (not (< j M))) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< (+ i 1) N)) (not (< j M)) (< k i)) (or (= (select A l) (select B l)) (< (+ j 1) M) (not (< (+ i 1) N)) (not (< j M)) (< k i) (<= (+ 2 k) l) (= l i) (= l j) (= (+ i 1) l)) (or (< (+ j 1) M) (= l k) (not (< (+ i 1) N)) (= l 0) (not (< j M)) (< k i) (<= (+ 2 k) l) (= (+ i 1) l))), 1386675#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< 2 i) (= M l) (<= N i) (not (<= l M)) (= l 0) (not (<= l 0))) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i))), 1386676#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 1 i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= M l) (not (<= l M)) (= l 0) (not (<= l 0)) (< 1 i)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1386667#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 1386670#(and (or (<= (+ l 1) N) (<= (+ 2 k) i) (< j M)) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (<= (+ k 1) l)) (or (< j M) (<= (+ k 1) i))), 1386672#(and (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (= (+ l 1) i) (not (< j M)) (< (+ 2 k) i) (<= (+ 2 k) l) (= l j)) (or (< (+ j 1) M) (= l k) (= l 0) (= (+ l 1) i) (not (< j M)) (< (+ 2 k) i) (<= (+ 2 k) l)) (or (<= (+ 2 k) i) (< (+ j 1) M) (not (< j M))) (or (<= (+ l 1) N) (< (+ j 1) M) (not (< j M)) (< (+ 2 k) i))), 1386673#(and (or (< (+ j 1) M) (<= (+ k 1) i) (not (< i N)) (not (< j M))) (or (< (+ j 1) M) (= l k) (< (+ k 1) i) (= l 0) (not (< i N)) (not (< j M)) (<= (+ 2 k) l) (= l i)) (or (<= (+ l 1) N) (< (+ j 1) M) (< (+ k 1) i) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (< (+ j 1) M) (= l k) (< (+ k 1) i) (not (< i N)) (not (< j M)) (<= (+ 2 k) l) (= l i) (= l j)))] [2022-03-15 22:24:45,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:24:45,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:45,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:24:45,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:24:45,165 INFO L87 Difference]: Start difference. First operand 9047 states and 41754 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:01,972 INFO L93 Difference]: Finished difference Result 13975 states and 58320 transitions. [2022-03-15 22:25:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-03-15 22:25:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:25:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:02,006 INFO L225 Difference]: With dead ends: 13975 [2022-03-15 22:25:02,006 INFO L226 Difference]: Without dead ends: 13916 [2022-03-15 22:25:02,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15517 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=7009, Invalid=38147, Unknown=0, NotChecked=0, Total=45156 [2022-03-15 22:25:02,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 516 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:02,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 0 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:25:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13916 states. [2022-03-15 22:25:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13916 to 9506. [2022-03-15 22:25:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9506 states, 9505 states have (on average 4.632088374539716) internal successors, (44028), 9505 states have internal predecessors, (44028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9506 states to 9506 states and 44028 transitions. [2022-03-15 22:25:02,248 INFO L78 Accepts]: Start accepts. Automaton has 9506 states and 44028 transitions. Word has length 19 [2022-03-15 22:25:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:02,248 INFO L470 AbstractCegarLoop]: Abstraction has 9506 states and 44028 transitions. [2022-03-15 22:25:02,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9506 states and 44028 transitions. [2022-03-15 22:25:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:02,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:02,266 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:02,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Ended with exit code 0 [2022-03-15 22:25:02,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,159 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:02,467 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash -130140628, now seen corresponding path program 127 times [2022-03-15 22:25:02,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:02,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219404230] [2022-03-15 22:25:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:02,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:02,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219404230] [2022-03-15 22:25:02,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219404230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:02,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336422575] [2022-03-15 22:25:02,981 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:25:02,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:02,982 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:02,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2022-03-15 22:25:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:03,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 22:25:03,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:03,238 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 22:25:03,286 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-03-15 22:25:03,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2022-03-15 22:25:03,348 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 22 treesize of output 24 [2022-03-15 22:25:03,381 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 23 treesize of output 28 [2022-03-15 22:25:03,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:25:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:03,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:03,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,732 INFO L353 Elim1Store]: treesize reduction 15, result has 76.9 percent of original size [2022-03-15 22:25:03,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 74 [2022-03-15 22:25:03,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:03,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 22:25:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:04,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336422575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:04,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:04,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:25:04,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948203910] [2022-03-15 22:25:04,003 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:04,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:04,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 22:25:04,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:05,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1420146#(or (= (select A l) (select B l)) (< j M) (< k N)), 1420143#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< 2 i) (<= N i) (not (= (+ i 1) M)) (= (+ (- 1) i) l) (= (+ l 1) (+ i 1)) (= l j) (< M (+ l 1))) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (<= l M) (not (= (+ i 1) M)))), 1420141#(and (or (= (+ j 1) l) (= l 0) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i) (< M (+ l 1))) (or (<= (+ l 1) N) (<= l M) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i)) (or (<= (+ 2 j) i) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (= (+ j 1) l) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i) (= l j) (< M (+ l 1))) (or (not (< i N)) (not (< j M)) (= M k))), 1420152#(and (or (= (+ j 1) l) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (< j i) (= l (+ 2 i)) (< M (+ l 1))) (or (= (select A l) (select B l)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (not (< j M)) (< j i) (= l (+ 2 i)) (= l i) (= (+ i 1) l) (< M (+ l 1))) (or (<= (+ l 1) N) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M) (not (< j M)) (< j i)) (or (not (< (+ 2 i) N)) (<= j i) (not (< j M))) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k))), 1420144#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M) (< (+ j 1) i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (not (< (+ i 1) N)) (= (+ j 1) l) (not (= M (+ 2 i))) (= l 0) (< (+ j 1) i) (= (+ i 1) l) (< M (+ l 1)))), 1420140#(and (or (= (select A l) (select B l)) (not (= M i)) (= (+ j 1) l) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i) (= l j) (< M (+ l 1))) (or (not (< j M)) (= M k)) (or (<= (+ l 1) N) (not (= M i)) (<= l M) (not (< j M)) (< (+ 3 j) i)) (or (not (= M i)) (= (+ j 1) l) (= l 0) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i) (< M (+ l 1))) (or (<= (+ 3 j) i) (not (< j M)))), 1420147#(and (or (<= l M) (< k N) (<= (+ j 1) M)) (or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M))), 1420149#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 1420148#(or (= (select A l) (select B l)) (<= N i) (= l i)), 1420145#(or (= (select A l) (select B l)) (< k N)), 1420142#(and (or (not (< (+ i 1) N)) (<= (+ j 1) i) (not (< j M))) (or (= (select A l) (select B l)) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (not (< j M)) (< (+ j 1) i) (= l i) (= l j) (= (+ i 1) l) (< M (+ l 1))) (or (not (< (+ i 1) N)) (not (< j M)) (= M k)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M) (not (< j M)) (< (+ j 1) i)) (or (not (< (+ i 1) N)) (= (+ j 1) l) (not (= M (+ 2 i))) (= l 0) (not (< j M)) (< (+ j 1) i) (= (+ i 1) l) (< M (+ l 1)))), 1420153#(and (or (<= (+ l 1) N) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M) (< j i)) (or (<= N (+ 2 i)) (= j 0)) (or (= (+ j 1) l) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (< j i) (= l (+ 2 i)) (< M (+ l 1))) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1420151#(and (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (<= M i)) (or (<= (+ N j 1) (+ M i)) (not (<= (+ M 1) i)) (< k N) (<= N (+ M 1))) (or (not (= M i)) (<= l M) (<= (+ N j 1) (+ M i)) (< k N)) (or (= (select A l) (select B l)) (not (= M i)) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j) (< M (+ l 1)))), 1420150#(and (or (<= j i) (< k N) (<= (+ N j) (+ M i)) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (< k N) (<= (+ N j) (+ M i)) (<= j l) (< M (+ l 1))) (or (not (<= (+ M 1) i)) (< k N) (<= N (+ M 1)) (<= (+ N j) (+ M i))) (or (not (= M i)) (<= l M) (< k N) (<= (+ N j) (+ M i)))), 1420094#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:25:05,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:25:05,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:25:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:25:05,819 INFO L87 Difference]: Start difference. First operand 9506 states and 44028 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:17,199 INFO L93 Difference]: Finished difference Result 12396 states and 53565 transitions. [2022-03-15 22:25:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 22:25:17,199 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:25:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:17,234 INFO L225 Difference]: With dead ends: 12396 [2022-03-15 22:25:17,234 INFO L226 Difference]: Without dead ends: 12384 [2022-03-15 22:25:17,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6133 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2450, Invalid=17572, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 22:25:17,235 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 411 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:17,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 0 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:25:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2022-03-15 22:25:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 9757. [2022-03-15 22:25:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9757 states, 9756 states have (on average 4.641963919639196) internal successors, (45287), 9756 states have internal predecessors, (45287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9757 states to 9757 states and 45287 transitions. [2022-03-15 22:25:17,498 INFO L78 Accepts]: Start accepts. Automaton has 9757 states and 45287 transitions. Word has length 19 [2022-03-15 22:25:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:17,498 INFO L470 AbstractCegarLoop]: Abstraction has 9757 states and 45287 transitions. [2022-03-15 22:25:17,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9757 states and 45287 transitions. [2022-03-15 22:25:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:17,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:17,516 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:17,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2022-03-15 22:25:17,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,160 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:17,717 INFO L402 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 725166026, now seen corresponding path program 128 times [2022-03-15 22:25:17,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:17,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138019192] [2022-03-15 22:25:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:18,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:18,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138019192] [2022-03-15 22:25:18,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138019192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:18,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449658306] [2022-03-15 22:25:18,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:25:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:18,318 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:18,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2022-03-15 22:25:18,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:25:18,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:18,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:25:18,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:18,519 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 22:25:18,561 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-03-15 22:25:18,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2022-03-15 22:25:18,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:18,635 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 30 treesize of output 32 [2022-03-15 22:25:18,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:18,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:18,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:18,677 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 37 treesize of output 42 [2022-03-15 22:25:18,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:25:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:18,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:19,085 INFO L353 Elim1Store]: treesize reduction 47, result has 51.5 percent of original size [2022-03-15 22:25:19,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 74 [2022-03-15 22:25:19,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:19,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:19,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:19,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 22:25:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:19,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449658306] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:19,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:19,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:25:19,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368890271] [2022-03-15 22:25:19,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:19,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:19,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 67 transitions. [2022-03-15 22:25:19,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:21,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1452402#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 1452398#(and (or (<= N (+ i 1)) (<= 1 i)) (or (not (< (+ i 1) N)) (= M l) (= (+ j 1) l) (not (= M (+ 2 i))) (not (<= l M)) (= l 0) (< (+ j 1) i) (= (+ i 1) l)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M) (< (+ j 1) i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1452400#(or (= (select A l) (select B l)) (< k N)), 1452395#(and (or (<= (+ 2 j) i) (not (< i N)) (not (< j M))) (or (<= (+ l 1) N) (<= l M) (not (< i N)) (not (= (+ i 1) M)) (< (+ 2 j) i) (<= M j)) (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (not (<= l M)) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i) (= l j)) (or (not (< i N)) (not (< j M)) (= M k)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i))), 1452403#(and (or (<= (+ 2 j) M) (<= l M) (< k N) (= l j)) (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j))), 1452394#(and (or (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (= (+ j 1) l) (not (<= l M)) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i) (= l j)) (or (<= (+ l 1) N) (not (= M i)) (<= l M) (< (+ 3 j) i) (<= M j)) (or (<= (+ 3 j) i) (not (< j M))) (or (not (= M i)) (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i))), 1452399#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 1452406#(and (or (<= (+ l 1) N) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M) (< j i)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (< j i) (= l (+ 2 i))) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1452397#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= (+ l 1) N) (<= l M) (not (< i N)) (not (= (+ i 1) M)) (< (+ 2 j) i)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (not (< i N)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i)) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i))), 1452404#(and (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (not (<= l 0)) (< k N) (= l j)) (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1)) (= l j)) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (= l j) (<= M i)) (or (not (= M i)) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j))), 1452401#(or (= (select A l) (select B l)) (< j M) (< k N)), 1452396#(and (or (= (select A l) (select B l)) (not (< (+ i 1) N)) (= M l) (not (= M (+ 2 i))) (not (<= l M)) (not (< j M)) (< (+ j 1) i) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (not (< j M))) (or (not (< (+ i 1) N)) (= M l) (= (+ j 1) l) (not (= M (+ 2 i))) (not (<= l M)) (= l 0) (not (< j M)) (< (+ j 1) i) (= (+ i 1) l)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (not (= M (+ 2 i))) (<= l M) (< (+ j 1) i) (<= M j)) (or (not (< (+ i 1) N)) (not (< j M)) (= M k))), 1452405#(and (or (not (< (+ 2 i) N)) (<= j i) (not (< j M))) (or (<= (+ l 1) N) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (<= l M) (< j i) (<= M j)) (or (= (select A l) (select B l)) (= M l) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (not (< j M)) (< j i) (= l (+ 2 i)) (= l i) (= (+ i 1) l)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (< j i) (= l (+ 2 i))) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k)))] [2022-03-15 22:25:21,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:25:21,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:25:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1937, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:25:21,404 INFO L87 Difference]: Start difference. First operand 9757 states and 45287 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:34,226 INFO L93 Difference]: Finished difference Result 12116 states and 52603 transitions. [2022-03-15 22:25:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 22:25:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:25:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:34,263 INFO L225 Difference]: With dead ends: 12116 [2022-03-15 22:25:34,263 INFO L226 Difference]: Without dead ends: 12089 [2022-03-15 22:25:34,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5640 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2539, Invalid=17767, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 22:25:34,264 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 376 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:34,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 0 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:25:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12089 states. [2022-03-15 22:25:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12089 to 9764. [2022-03-15 22:25:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9764 states, 9763 states have (on average 4.643449759295299) internal successors, (45334), 9763 states have internal predecessors, (45334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9764 states to 9764 states and 45334 transitions. [2022-03-15 22:25:34,482 INFO L78 Accepts]: Start accepts. Automaton has 9764 states and 45334 transitions. Word has length 19 [2022-03-15 22:25:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:34,482 INFO L470 AbstractCegarLoop]: Abstraction has 9764 states and 45334 transitions. [2022-03-15 22:25:34,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 9764 states and 45334 transitions. [2022-03-15 22:25:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:34,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:34,499 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:34,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:34,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,161 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:34,700 INFO L402 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1469868524, now seen corresponding path program 129 times [2022-03-15 22:25:34,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:34,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274737989] [2022-03-15 22:25:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:35,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:35,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274737989] [2022-03-15 22:25:35,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274737989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:35,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553052393] [2022-03-15 22:25:35,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:25:35,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:35,268 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:35,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2022-03-15 22:25:35,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:25:35,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:35,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:25:35,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:35,492 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 8 treesize of output 7 [2022-03-15 22:25:35,544 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 22:25:35,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-03-15 22:25:35,587 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 20 treesize of output 22 [2022-03-15 22:25:35,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:35,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:35,624 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 31 treesize of output 36 [2022-03-15 22:25:35,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:25:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:35,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:35,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,981 INFO L353 Elim1Store]: treesize reduction 15, result has 76.9 percent of original size [2022-03-15 22:25:35,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 74 [2022-03-15 22:25:35,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:35,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 22:25:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:36,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553052393] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:36,268 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:36,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 22:25:36,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357629207] [2022-03-15 22:25:36,269 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:36,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:36,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 77 transitions. [2022-03-15 22:25:36,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:38,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1484395#(and (or (= M l) (= l 0) (< k N) (< (+ 2 j) M) (= l j) (= (+ l 1) M)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) M) (< k N) (= l j)) (or (<= (+ 2 j) M) (< k N))), 1484388#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 1484394#(or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) M) (< k N) (<= M (+ j 1)) (= l j)), 1484387#(and (or (<= N (+ i 1)) (<= 1 i)) (or (not (< (+ i 1) N)) (= M l) (= (+ j 1) l) (not (= M (+ 2 i))) (not (<= l M)) (= l 0) (< (+ j 1) i) (= (+ i 1) l)) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M (+ 2 i))) (<= l M) (< 1 i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1484389#(or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) M) (<= M (+ j 1)) (= l j)), 1484385#(and (or (<= (+ l 1) N) (not (< (+ i 1) N)) (= M l) (not (= M (+ 2 i))) (= l 0) (< (+ j 1) i) (<= M j)) (or (= (select A l) (select B l)) (not (< (+ i 1) N)) (= M l) (not (= M (+ 2 i))) (not (< j M)) (not (= l 0)) (< (+ j 1) i) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (not (< j M))) (or (not (< (+ i 1) N)) (= M l) (= (+ j 1) l) (not (= M (+ 2 i))) (not (<= l M)) (= l 0) (not (< j M)) (< (+ j 1) i) (= (+ i 1) l)) (or (not (< (+ i 1) N)) (not (< j M)) (= M k))), 1484397#(and (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (< j i) (= l (+ 2 i))) (or (<= (+ l 1) N) (<= N (+ 2 i)) (= M l) (not (= (+ 3 i) M)) (< j i)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1484393#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j)), 1484384#(and (or (<= (+ l 1) N) (= M l) (= l 0) (not (< i N)) (not (= (+ i 1) M)) (< (+ 2 j) i) (<= M j)) (or (<= (+ 2 j) i) (not (< i N)) (not (< j M))) (or (not (< i N)) (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (not (= l 0)) (< (+ 2 j) i) (= l i) (= l j)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (not (< i N)) (not (< j M)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i))), 1484390#(or (= (select A l) (select B l)) (< k N)), 1484391#(or (= (select A l) (select B l)) (< j M) (< k N)), 1484386#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (not (< i N)) (not (= (+ i 1) M)) (< (+ 2 j) i) (= l i)) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (<= l M) (not (= (+ i 1) M)))), 1484396#(and (or (not (< (+ 2 i) N)) (<= j i) (not (< j M))) (or (= (select A l) (select B l)) (= M l) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (not (< j M)) (< j i) (not (= l 0)) (= l (+ 2 i)) (= l i) (= (+ i 1) l)) (or (<= (+ l 1) N) (= M l) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (< j i) (<= M j)) (or (= M l) (= (+ j 1) l) (not (<= l M)) (not (= (+ 3 i) M)) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (< j i) (= l (+ 2 i))) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k))), 1484383#(and (or (not (< j M)) (= M k)) (or (<= (+ 3 j) i) (not (< j M))) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (= (+ j 1) l) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i) (not (= l 0)) (= l j)) (or (<= (+ l 1) N) (not (= M i)) (= M l) (= (+ j 1) l) (= l 0) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i)) (or (not (= M i)) (= M l) (= (+ j 1) l) (not (<= l M)) (= l 0) (= (+ l 1) i) (not (< j M)) (< (+ 3 j) i))), 1484392#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j))] [2022-03-15 22:25:38,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:25:38,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:25:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1937, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:25:38,418 INFO L87 Difference]: Start difference. First operand 9764 states and 45334 transitions. Second operand has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:47,373 INFO L93 Difference]: Finished difference Result 11821 states and 51803 transitions. [2022-03-15 22:25:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 22:25:47,374 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:25:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:47,401 INFO L225 Difference]: With dead ends: 11821 [2022-03-15 22:25:47,401 INFO L226 Difference]: Without dead ends: 11806 [2022-03-15 22:25:47,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3075 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1817, Invalid=11065, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 22:25:47,401 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:47,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:25:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2022-03-15 22:25:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 9776. [2022-03-15 22:25:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9776 states, 9775 states have (on average 4.643887468030691) internal successors, (45394), 9775 states have internal predecessors, (45394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9776 states to 9776 states and 45394 transitions. [2022-03-15 22:25:47,590 INFO L78 Accepts]: Start accepts. Automaton has 9776 states and 45394 transitions. Word has length 19 [2022-03-15 22:25:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:47,590 INFO L470 AbstractCegarLoop]: Abstraction has 9776 states and 45394 transitions. [2022-03-15 22:25:47,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:25:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9776 states and 45394 transitions. [2022-03-15 22:25:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:47,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:47,608 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:47,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:47,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,162 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:47,808 INFO L402 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:25:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1999573396, now seen corresponding path program 130 times [2022-03-15 22:25:47,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:47,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669035210] [2022-03-15 22:25:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:48,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:48,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669035210] [2022-03-15 22:25:48,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669035210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:48,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764041791] [2022-03-15 22:25:48,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:25:48,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:48,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:48,285 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:25:48,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2022-03-15 22:25:48,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:25:48,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 22:25:48,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:48,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 12 treesize of output 11 [2022-03-15 22:25:48,525 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:25:48,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:25:48,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,567 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 31 treesize of output 36 [2022-03-15 22:25:48,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-03-15 22:25:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:48,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-03-15 22:25:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:48,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:48,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:49,035 INFO L353 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2022-03-15 22:25:49,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 93 [2022-03-15 22:25:49,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:49,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:49,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 466 [2022-03-15 22:25:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:49,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764041791] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:49,426 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:49,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:25:49,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022109141] [2022-03-15 22:25:49,426 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:49,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:49,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 60 transitions. [2022-03-15 22:25:49,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:50,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1516052#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 1516056#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 1 i)) (or (<= N (+ i 1)) (< 1 i) (<= 2 l) (= (+ 2 l) (+ 2 i)) (= l j) (= k (+ 2 i)) (< M (+ l 1))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1516049#(and (or (<= (+ 2 j) i) (not (< i N)) (<= M j)) (or (= (+ j 1) l) (<= (+ 3 j) i) (= l 0) (not (< i N)) (not (< j M)) (= (+ i 1) k) (<= (+ 2 j) l)) (or (not (< i N)) (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) i) (not (< i N)) (not (< j M)) (= (+ i 1) k) (= l j) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ 3 j) i) (not (< i N)) (not (< j M)))), 1516047#(or (= (select A l) (select B l)) (< k N)), 1516058#(and (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i))) (or (<= N (+ 2 i)) (= j 0)) (or (< 0 i) (<= N (+ 2 i)) (= (+ 2 l) (+ 3 i)) (= (+ 3 i) k) (<= 2 l) (= l j) (< M (+ l 1))) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1516057#(and (or (not (< (+ 2 i) N)) (<= j i) (<= M j)) (or (= (+ j 1) l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= (+ 3 i) k) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= (+ 3 i) k) (not (< j M)) (= l i) (= (+ i 1) l) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ j 1) i) (not (< (+ 2 i) N)) (not (< j M)))), 1516053#(or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)), 1516048#(and (or (not (< j M)) (= M k)) (or (<= (+ l 1) N) (<= (+ j 4) i) (not (< j M))) (or (<= (+ 3 j) i) (<= M j)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ j 4) i) (= k i) (not (< j M)) (= l j) (<= (+ 2 j) l)) (or (= (+ j 1) l) (<= (+ j 4) i) (= k i) (= l 0) (not (< j M)) (<= (+ 2 j) l))), 1516051#(or (= (select A l) (select B l)) (< j M) (< k N)), 1516055#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (< 2 i) (<= N i) (= (+ i 1) (+ 2 l)) (= (+ i 1) k) (<= 2 l) (= l j) (< M (+ l 1))) (or (<= N i) (= j 0)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i))), 1516054#(and (or (<= (+ l 1) N) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (< j M))) (or (<= (+ 2 j) i) (not (< (+ i 1) N)) (= (+ j 1) l) (= l 0) (not (< j M)) (= k (+ 2 i)) (<= (+ 2 j) l)) (or (= (select A l) (select B l)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (< j M)) (= l i) (= l j) (= k (+ 2 i)) (<= (+ 2 j) l)) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (<= M j)) (or (not (< (+ i 1) N)) (not (< j M)) (= M k))), 1516050#(or (= (select A l) (select B l)) (< j M))] [2022-03-15 22:25:50,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:25:50,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:50,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:25:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1793, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:25:50,802 INFO L87 Difference]: Start difference. First operand 9776 states and 45394 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:01,012 INFO L93 Difference]: Finished difference Result 12656 states and 54551 transitions. [2022-03-15 22:26:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 22:26:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:26:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:01,045 INFO L225 Difference]: With dead ends: 12656 [2022-03-15 22:26:01,045 INFO L226 Difference]: Without dead ends: 12632 [2022-03-15 22:26:01,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6245 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2983, Invalid=15923, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 22:26:01,046 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:01,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:26:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2022-03-15 22:26:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 9786. [2022-03-15 22:26:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9786 states, 9785 states have (on average 4.64200306591722) internal successors, (45422), 9785 states have internal predecessors, (45422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 45422 transitions. [2022-03-15 22:26:01,274 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 45422 transitions. Word has length 19 [2022-03-15 22:26:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:01,274 INFO L470 AbstractCegarLoop]: Abstraction has 9786 states and 45422 transitions. [2022-03-15 22:26:01,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 45422 transitions. [2022-03-15 22:26:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:01,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:01,292 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:01,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Ended with exit code 0 [2022-03-15 22:26:01,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,163 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:01,493 INFO L402 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1193768970, now seen corresponding path program 131 times [2022-03-15 22:26:01,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:01,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250220737] [2022-03-15 22:26:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:01,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:01,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250220737] [2022-03-15 22:26:01,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250220737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:01,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390901353] [2022-03-15 22:26:01,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:26:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:01,943 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2022-03-15 22:26:02,046 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 22:26:02,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:02,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 22:26:02,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:02,152 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 22:26:02,198 INFO L353 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-03-15 22:26:02,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:26:02,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,239 INFO L353 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2022-03-15 22:26:02,239 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 38 [2022-03-15 22:26:02,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,315 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 31 treesize of output 36 [2022-03-15 22:26:02,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:02,362 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:26:02,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:26:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:02,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:02,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:02,734 INFO L353 Elim1Store]: treesize reduction 15, result has 81.0 percent of original size [2022-03-15 22:26:02,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 88 [2022-03-15 22:26:02,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:02,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:02,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:02,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-03-15 22:26:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:02,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390901353] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:02,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:02,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 22:26:02,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626039809] [2022-03-15 22:26:02,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:02,993 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:02,997 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 60 transitions. [2022-03-15 22:26:02,997 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:04,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1548622#(and (or (<= (+ l 1) N) (= M l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= l 0) (not (< j M))) (or (not (< (+ 2 i) N)) (<= j i) (not (< j M))) (or (= (+ j 1) l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (= (select A l) (select B l)) (= M l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (not (< j M)) (not (= l 0)) (= l (+ 2 i)) (= (+ 3 i) l) (= l i) (= (+ i 1) l)) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k)) (or (= M l) (= (+ j 1) l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (< 0 l))), 1548615#(or (= (select A l) (select B l)) (<= N i) (= l i)), 1548623#(and (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (= M l)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (< 0 i) (<= N (+ 2 i)) (= M l) (= l 0) (< 0 l)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1548616#(or (= (select A l) (select B l)) (< k N)), 1548619#(or (= (select A l) (select B l)) (<= N i) (< j M) (< k N) (= l i)), 1548613#(and (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (<= (+ 3 j) i) (not (< i N)) (not (< j M)) (not (= l 0)) (= l i) (= l j) (= (+ i 1) l)) (or (<= (+ 2 j) i) (not (< i N)) (not (< j M))) (or (= M l) (= (+ j 1) l) (<= (+ 3 j) i) (= l 0) (not (< i N)) (not (< j M)) (< 0 l)) (or (= (+ j 1) l) (<= (+ 3 j) i) (= l 0) (not (< i N)) (not (< j M)) (<= (+ 2 j) l)) (or (not (< i N)) (not (< j M)) (= M k)) (or (<= (+ l 1) N) (= M l) (<= (+ 3 j) i) (= l 0) (not (< i N)) (not (< j M)))), 1548620#(and (or (<= (+ l 1) N) (<= (+ 2 j) i) (not (< (+ i 1) N)) (= M l) (= l 0) (not (< j M))) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (not (< j M))) (or (<= (+ 2 j) i) (not (< (+ i 1) N)) (= (+ j 1) l) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (= (select A l) (select B l)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (= M l) (not (< j M)) (not (= l 0)) (= l (+ 2 i)) (= l i) (= l j) (= (+ i 1) l)) (or (not (< (+ i 1) N)) (not (< j M)) (= M k)) (or (<= (+ 2 j) i) (not (< (+ i 1) N)) (= M l) (= (+ j 1) l) (= l 0) (not (< j M)) (< 0 l))), 1548612#(and (or (not (< j M)) (= M k)) (or (= M l) (= (+ j 1) l) (<= (+ j 4) i) (= l 0) (not (< j M)) (< 0 l)) (or (= (+ j 1) l) (<= (+ j 4) i) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (= (select A l) (select B l)) (= M l) (= (+ j 1) l) (<= (+ j 4) i) (not (< j M)) (not (= l 0)) (= l i) (= l j)) (or (<= (+ 3 j) i) (not (< j M))) (or (<= (+ l 1) N) (= M l) (= (+ j 1) l) (<= (+ j 4) i) (= l 0) (not (< j M)))), 1548617#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 1548614#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (< 2 i) (= M l) (<= N i)) (or (<= 2 i) (<= N i)) (or (< 2 i) (= M l) (<= N i) (= l 0) (< 0 l))), 1548618#(or (= (select A l) (select B l)) (< j M) (< k N)), 1548621#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (= M l) (= l 0) (< 1 i) (< 0 l)) (or (<= N (+ i 1)) (<= (+ l 1) N) (= M l) (< 1 i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)))] [2022-03-15 22:26:04,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:26:04,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:26:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1720, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:26:04,659 INFO L87 Difference]: Start difference. First operand 9786 states and 45422 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:12,658 INFO L93 Difference]: Finished difference Result 11967 states and 52087 transitions. [2022-03-15 22:26:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:26:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:26:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:12,688 INFO L225 Difference]: With dead ends: 11967 [2022-03-15 22:26:12,688 INFO L226 Difference]: Without dead ends: 11955 [2022-03-15 22:26:12,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1941, Invalid=11399, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 22:26:12,689 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 338 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:12,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 0 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2022-03-15 22:26:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 9803. [2022-03-15 22:26:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9803 states, 9802 states have (on average 4.643236074270557) internal successors, (45513), 9802 states have internal predecessors, (45513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9803 states to 9803 states and 45513 transitions. [2022-03-15 22:26:12,909 INFO L78 Accepts]: Start accepts. Automaton has 9803 states and 45513 transitions. Word has length 19 [2022-03-15 22:26:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:12,910 INFO L470 AbstractCegarLoop]: Abstraction has 9803 states and 45513 transitions. [2022-03-15 22:26:12,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9803 states and 45513 transitions. [2022-03-15 22:26:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:12,928 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:12,928 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:12,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2022-03-15 22:26:13,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,164 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:13,129 INFO L402 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2049075624, now seen corresponding path program 132 times [2022-03-15 22:26:13,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:13,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235753261] [2022-03-15 22:26:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:13,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:13,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235753261] [2022-03-15 22:26:13,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235753261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:13,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632154300] [2022-03-15 22:26:13,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:26:13,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:13,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:13,562 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:13,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2022-03-15 22:26:13,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:26:13,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:13,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:26:13,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:13,766 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 8 treesize of output 7 [2022-03-15 22:26:13,806 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-03-15 22:26:13,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 22:26:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:13,848 INFO L353 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-03-15 22:26:13,848 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2022-03-15 22:26:13,971 INFO L353 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2022-03-15 22:26:13,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2022-03-15 22:26:14,080 INFO L353 Elim1Store]: treesize reduction 66, result has 16.5 percent of original size [2022-03-15 22:26:14,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 46 [2022-03-15 22:26:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:14,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:14,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:14,697 INFO L353 Elim1Store]: treesize reduction 30, result has 63.0 percent of original size [2022-03-15 22:26:14,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 75 [2022-03-15 22:26:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:14,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632154300] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:14,945 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:14,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:26:14,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95468300] [2022-03-15 22:26:14,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:14,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:14,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 65 transitions. [2022-03-15 22:26:14,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:16,401 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1580485#(or (= (select A l) (select B l)) (< j M) (< k N)), 1580484#(or (= (select A l) (select B l)) (< k N)), 1580482#(and (or (<= (+ 2 j) i) (not (< i N)) (not (< j M))) (or (= (+ j 1) l) (<= (+ 3 j) i) (= l 0) (not (< i N)) (not (< j M)) (<= (+ 2 j) l)) (or (not (< i N)) (not (< j M)) (= M k)) (or (<= (+ l 1) N) (= M l) (<= (+ 3 j) i) (not (< i N)) (not (< j M))) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ 3 j) i) (not (< i N)) (not (< j M)) (= l j) (<= (+ 2 j) l))), 1580488#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j)), 1580489#(and (or (= (select A l) (select B l)) (<= (+ 2 j) i) (not (< (+ i 1) N)) (not (< j M)) (= l i) (= l j) (<= (+ 2 j) l)) (or (not (< (+ i 1) N)) (<= (+ j 1) i) (not (< j M))) (or (<= (+ 2 j) i) (not (< (+ i 1) N)) (= (+ j 1) l) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (<= (+ 2 j) i) (not (< (+ i 1) N)) (= M l) (not (< j M))) (or (not (< (+ i 1) N)) (not (< j M)) (= M k))), 1580487#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 1580491#(and (or (not (< (+ 2 i) N)) (<= j i) (not (< j M))) (or (= (select A l) (select B l)) (<= (+ j 1) i) (not (< (+ 2 i) N)) (not (< j M)) (= l i) (= (+ i 1) l) (<= (+ 2 j) l)) (or (= (+ j 1) l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (= M l) (<= (+ j 1) i) (not (< (+ 2 i) N)) (not (< j M))) (or (not (< (+ 2 i) N)) (not (< j M)) (= M k))), 1580483#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (<= (+ l 1) N) (< 2 i) (= M l) (<= N i)) (or (<= 2 i) (<= N i)) (or (< 2 i) (<= N i) (= (+ l 1) i) (= l j) (<= (+ 2 j) l) (< M (+ l 1)))), 1580492#(and (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (= M l)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (< 0 i) (<= N (+ 2 i)) (= (+ l 1) (+ 2 i)) (= l j) (<= (+ 2 j) l) (< M (+ l 1))) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1580486#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 1580481#(and (or (not (< j M)) (= M k)) (or (= (select A l) (select B l)) (= (+ j 1) l) (<= (+ j 4) i) (not (< j M)) (= l j) (<= (+ 2 j) l)) (or (= (+ j 1) l) (<= (+ j 4) i) (= l 0) (not (< j M)) (<= (+ 2 j) l)) (or (<= (+ l 1) N) (= M l) (= (+ j 1) l) (<= (+ j 4) i) (not (< j M))) (or (<= (+ 3 j) i) (not (< j M)))), 1580490#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (= (+ l 1) (+ i 1)) (< 1 i) (= l j) (<= (+ 2 j) l) (< M (+ l 1))) (or (<= N (+ i 1)) (<= (+ l 1) N) (= M l) (< 1 i)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)))] [2022-03-15 22:26:16,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:26:16,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:26:16,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1845, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:26:16,402 INFO L87 Difference]: Start difference. First operand 9803 states and 45513 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:26,311 INFO L93 Difference]: Finished difference Result 12122 states and 52548 transitions. [2022-03-15 22:26:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 22:26:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:26:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:26,342 INFO L225 Difference]: With dead ends: 12122 [2022-03-15 22:26:26,342 INFO L226 Difference]: Without dead ends: 12106 [2022-03-15 22:26:26,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4741 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2257, Invalid=14513, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 22:26:26,343 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:26,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:26:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12106 states. [2022-03-15 22:26:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12106 to 9822. [2022-03-15 22:26:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9822 states, 9821 states have (on average 4.645962732919255) internal successors, (45628), 9821 states have internal predecessors, (45628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9822 states to 9822 states and 45628 transitions. [2022-03-15 22:26:26,612 INFO L78 Accepts]: Start accepts. Automaton has 9822 states and 45628 transitions. Word has length 19 [2022-03-15 22:26:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:26,612 INFO L470 AbstractCegarLoop]: Abstraction has 9822 states and 45628 transitions. [2022-03-15 22:26:26,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9822 states and 45628 transitions. [2022-03-15 22:26:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:26,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:26,631 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:26,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:26,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable165 [2022-03-15 22:26:26,831 INFO L402 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 454466796, now seen corresponding path program 33 times [2022-03-15 22:26:26,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:26,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739787187] [2022-03-15 22:26:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:27,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:27,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739787187] [2022-03-15 22:26:27,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739787187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:27,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598552417] [2022-03-15 22:26:27,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:26:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:27,182 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2022-03-15 22:26:27,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:26:27,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:27,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:26:27,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:27,437 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 22:26:27,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,471 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 22:26:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,507 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 31 treesize of output 36 [2022-03-15 22:26:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,570 INFO L353 Elim1Store]: treesize reduction 38, result has 48.6 percent of original size [2022-03-15 22:26:27,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 60 [2022-03-15 22:26:27,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:27,905 INFO L353 Elim1Store]: treesize reduction 44, result has 45.0 percent of original size [2022-03-15 22:26:27,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 101 [2022-03-15 22:26:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:29,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:29,972 INFO L353 Elim1Store]: treesize reduction 37, result has 61.9 percent of original size [2022-03-15 22:26:29,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 84 [2022-03-15 22:26:29,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:29,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 224 treesize of output 222 [2022-03-15 22:26:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:30,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598552417] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:30,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:30,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-03-15 22:26:30,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581530953] [2022-03-15 22:26:30,489 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:30,490 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:30,494 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 81 transitions. [2022-03-15 22:26:30,494 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:32,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [1612576#(or (= (select A l) (select B l)) (<= N i) (< j M) (= l i)), 1612586#(and (or (<= 2 i) (<= N i) (not (= M 0))) (or (<= N i) (= M 0) (= j 0)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (not (= M 0))) (or (< 2 i) (= l k) (<= N i) (= (+ (- 1) i) l) (not (= M 0)) (= l i) (<= 3 l)) (or (<= N i) (= k 0) (not (= M 0))) (or (<= N i) (= M 0) (< 0 M))), 1612575#(or (= (select A l) (select B l)) (< j M) (< k N)), 1612580#(and (or (= (select A l) (select B l)) (= l k) (< j M) (= (+ (- 1) i) l) (< (+ 2 k) i) (<= (+ 2 k) l)) (or (<= (+ 2 k) i) (< j M)) (or (<= (+ l 1) N) (< j M) (< (+ 2 k) i)) (or (= l k) (< j M) (= l 0) (= (+ (- 1) i) l) (< (+ 2 k) i) (<= (+ 2 k) l))), 1612585#(and (or (<= N (+ 2 i)) (<= 0 i) (< j M)) (or (<= N (+ 2 i)) (< j M) (= k 0)) (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (< j M)) (or (< 0 i) (<= N (+ 2 i)) (= l k) (< j M) (= l (+ 2 i)) (<= 3 l) (= (+ i 1) l))), 1612573#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< 1 i)) (or (<= N (+ i 1)) (= l k) (< 1 i) (= l i) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= k 0))), 1612578#(and (or (<= (+ l 1) N) (< j M) (<= l k) (< k i)) (or (= (select A l) (select B l)) (< k (+ l 1)) (< j M) (< k i)) (or (< j M) (< k (+ i 1)))), 1612582#(and (or (<= N i) (< j M) (= k 0)) (or (<= 2 i) (<= N i) (< j M)) (or (< 2 i) (= l k) (<= N i) (< j M) (= (+ (- 1) i) l) (= l i) (<= 3 l)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (< j M))), 1612587#(and (or (<= N (+ i 1)) (= k 0) (not (= M 0))) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M 0)) (< 1 i)) (or (<= N (+ i 1)) (= M 0) (< 0 M)) (or (<= N (+ i 1)) (= l k) (not (= M 0)) (< 1 i) (= l i) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (not (= M 0)) (<= 1 i)) (or (<= N (+ i 1)) (= M 0) (= j 0))), 1612577#(or (= (select A l) (select B l)) (<= (+ k 1) N) (<= k i) (< j M) (= l i)), 1612584#(and (or (< 0 i) (<= N (+ 2 i)) (= l k) (= l (+ 2 i)) (<= 3 l) (= (+ i 1) l)) (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i))) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= N (+ 2 i)) (= k 0))), 1612579#(and (or (<= (+ l 1) N) (<= (+ 2 k) i) (< j M)) (or (= (select A l) (select B l)) (<= (+ 2 k) i) (= l k) (< j M) (<= (+ k 1) l)) (or (< j M) (<= (+ k 1) i))), 1612571#(or (= (select A l) (select B l)) (< k N)), 1612574#(or (= (select A l) (select B l)) (< j M)), 1612572#(and (or (< 2 i) (= l k) (<= N i) (= (+ (- 1) i) l) (= l i) (<= 3 l)) (or (<= 2 i) (<= N i)) (or (<= N i) (= k 0)) (or (<= (+ l 1) N) (< 2 i) (<= N i))), 1612583#(and (or (<= N (+ i 1)) (= l k) (< j M) (< 1 i) (= l i) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< j M) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (< j M) (< 1 i))), 1612588#(and (or (<= N (+ 2 i)) (<= 0 i) (not (= M 0))) (or (<= N (+ 2 i)) (= k 0) (not (= M 0))) (or (<= N (+ 2 i)) (= M 0) (= j 0)) (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (not (= M 0))) (or (< 0 i) (<= N (+ 2 i)) (= l k) (not (= M 0)) (= l (+ 2 i)) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ 2 i)) (= M 0) (< 0 M))), 1612581#(and (or (= l k) (< j M) (= (+ (- 2) i) l) (< 3 i) (= (+ (- 1) i) l) (<= 3 l)) (or (< j M) (= k 0)) (or (<= 3 i) (< j M)) (or (<= (+ l 1) N) (< j M) (< 3 i)))] [2022-03-15 22:26:32,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:26:32,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:26:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2524, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 22:26:32,307 INFO L87 Difference]: Start difference. First operand 9822 states and 45628 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:38,194 INFO L93 Difference]: Finished difference Result 10692 states and 48085 transitions. [2022-03-15 22:26:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 22:26:38,195 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:26:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:38,223 INFO L225 Difference]: With dead ends: 10692 [2022-03-15 22:26:38,224 INFO L226 Difference]: Without dead ends: 10668 [2022-03-15 22:26:38,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2075, Invalid=12205, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 22:26:38,225 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 368 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:38,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 0 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2022-03-15 22:26:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 9809. [2022-03-15 22:26:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9809 states, 9808 states have (on average 4.648756117455139) internal successors, (45595), 9808 states have internal predecessors, (45595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9809 states to 9809 states and 45595 transitions. [2022-03-15 22:26:38,423 INFO L78 Accepts]: Start accepts. Automaton has 9809 states and 45595 transitions. Word has length 19 [2022-03-15 22:26:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:38,423 INFO L470 AbstractCegarLoop]: Abstraction has 9809 states and 45595 transitions. [2022-03-15 22:26:38,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 9809 states and 45595 transitions. [2022-03-15 22:26:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:38,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:38,442 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:38,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2022-03-15 22:26:38,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2022-03-15 22:26:38,643 INFO L402 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1614379608, now seen corresponding path program 133 times [2022-03-15 22:26:38,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:38,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913770770] [2022-03-15 22:26:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:39,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:39,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913770770] [2022-03-15 22:26:39,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913770770] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:39,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862164084] [2022-03-15 22:26:39,238 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:26:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:39,240 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:39,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2022-03-15 22:26:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:39,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:26:39,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:39,514 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 8 treesize of output 7 [2022-03-15 22:26:39,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:39,543 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 20 treesize of output 22 [2022-03-15 22:26:39,575 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 23 treesize of output 28 [2022-03-15 22:26:39,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:26:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:39,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:39,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:39,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:39,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:39,845 INFO L353 Elim1Store]: treesize reduction 20, result has 69.2 percent of original size [2022-03-15 22:26:39,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 66 [2022-03-15 22:26:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:40,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862164084] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:40,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:40,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 22:26:40,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069750036] [2022-03-15 22:26:40,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:40,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:40,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 22:26:40,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:41,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1643179#(or (= (select A l) (select B l)) (<= N i) (< k N) (= l i)), 1643182#(and (or (<= (+ N j 1) (+ M i)) (< k N)) (or (<= (+ 2 j) i) (< k N) (< (+ N j 1) (+ M i)) (<= M i)) (or (not (<= (+ M 1) i)) (< k N) (< (+ N j 1) (+ M i)) (<= N (+ M 1))) (or (= (+ N l) (+ M i)) (not (= M i)) (= l 0) (< k N) (< (+ N j 1) (+ M i)) (= l j) (<= (+ 2 j) l) (< M (+ l 1))) (or (= (select A l) (select B l)) (= (+ N l) (+ M i)) (not (= M i)) (< k N) (< (+ N j 1) (+ M i)) (= l j) (<= (+ 2 j) l) (< M (+ l 1))) (or (not (= M i)) (<= l M) (< k N) (< (+ N j 1) (+ M i)))), 1643174#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (< 2 i) (<= N i) (= l 0) (not (= (+ i 1) M)) (= (+ (- 1) i) l) (= (+ l 1) (+ i 1)) (< M (+ l 1))) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (<= l M) (not (= (+ i 1) M)))), 1643183#(and (or (< 0 i) (<= N (+ 2 i)) (not (= (+ 3 i) M)) (= (+ l 1) (+ 3 i)) (= l 0) (= (+ i 1) l) (< M (+ l 1))) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (not (= (+ 3 i) M)) (<= l M)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1643176#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M (+ 2 i))) (<= l M) (< 1 i)) (or (<= N (+ i 1)) (not (= M (+ 2 i))) (= l 0) (= (+ l 1) (+ 2 i)) (< 1 i) (= l i) (< M (+ l 1))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1643127#(or (= (select A l) (select B l)) (< j M)), 1643178#(or (= (select A l) (select B l)) (<= N i) (= l i)), 1643181#(and (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (<= M i)) (or (<= (+ N j 1) (+ M i)) (not (<= (+ M 1) i)) (< k N) (<= N (+ M 1))) (or (not (= M i)) (<= l M) (<= (+ N j 1) (+ M i)) (< k N)) (or (= (select A l) (select B l)) (not (= M i)) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j) (< M (+ l 1)))), 1643180#(and (or (<= j i) (< k N) (<= (+ N j) (+ M i)) (<= M i)) (or (= (select A l) (select B l)) (not (= M i)) (< k N) (<= (+ N j) (+ M i)) (<= j l) (< M (+ l 1))) (or (not (<= (+ M 1) i)) (< k N) (<= N (+ M 1)) (<= (+ N j) (+ M i))) (or (not (= M i)) (<= l M) (< k N) (<= (+ N j) (+ M i)))), 1643175#(or (= (select A l) (select B l)) (< j M) (< k N)), 1643173#(or (= (select A l) (select B l)) (< k N)), 1643177#(and (or (<= l M) (< k N) (<= (+ j 1) M)) (or (= (select A l) (select B l)) (< k N) (<= (+ j 1) M)))] [2022-03-15 22:26:41,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:26:41,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:41,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:26:41,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:26:41,383 INFO L87 Difference]: Start difference. First operand 9809 states and 45595 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:47,891 INFO L93 Difference]: Finished difference Result 10844 states and 48733 transitions. [2022-03-15 22:26:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 22:26:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:26:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:47,918 INFO L225 Difference]: With dead ends: 10844 [2022-03-15 22:26:47,918 INFO L226 Difference]: Without dead ends: 10833 [2022-03-15 22:26:47,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1406, Invalid=10150, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 22:26:47,919 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 346 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:47,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 0 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:26:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10833 states. [2022-03-15 22:26:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10833 to 9835. [2022-03-15 22:26:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9835 states, 9834 states have (on average 4.647549318690258) internal successors, (45704), 9834 states have internal predecessors, (45704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9835 states to 9835 states and 45704 transitions. [2022-03-15 22:26:48,114 INFO L78 Accepts]: Start accepts. Automaton has 9835 states and 45704 transitions. Word has length 19 [2022-03-15 22:26:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:48,114 INFO L470 AbstractCegarLoop]: Abstraction has 9835 states and 45704 transitions. [2022-03-15 22:26:48,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:26:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9835 states and 45704 transitions. [2022-03-15 22:26:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:48,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:48,133 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:48,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Forceful destruction successful, exit code 0 [2022-03-15 22:26:48,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable167 [2022-03-15 22:26:48,333 INFO L402 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:26:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1825281034, now seen corresponding path program 134 times [2022-03-15 22:26:48,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:48,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779536448] [2022-03-15 22:26:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:48,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:48,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779536448] [2022-03-15 22:26:48,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779536448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:48,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470304040] [2022-03-15 22:26:48,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:26:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:48,926 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:26:48,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2022-03-15 22:26:49,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:26:49,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:49,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:26:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:49,145 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 22:26:49,172 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 16 treesize of output 18 [2022-03-15 22:26:49,211 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-03-15 22:26:49,212 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:26:49,261 INFO L353 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2022-03-15 22:26:49,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:26:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:49,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:49,523 INFO L353 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-03-15 22:26:49,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 35 treesize of output 66 [2022-03-15 22:26:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:26:49,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470304040] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:49,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:49,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-03-15 22:26:49,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763862232] [2022-03-15 22:26:49,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:49,747 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:49,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 67 transitions. [2022-03-15 22:26:49,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:51,112 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1673968#(and (or (<= (+ 2 j) M) (<= l M) (< k N) (= l j)) (or (= (select A l) (select B l)) (<= (+ 2 j) M) (< k N) (= l j))), 1673964#(or (= (select A l) (select B l)) (<= (+ 2 j) M) (not (< j M)) (= l j)), 1673970#(and (or (<= (+ N j 1) (+ M i)) (< k N)) (or (= l (+ M i (* (- 1) N))) (< i (+ M 1)) (< k N) (< (+ N j 1) (+ M i)) (<= N (+ M 1))) (or (= (+ N l) (+ M i)) (not (= M i)) (<= l M) (< k N) (< (+ N j 1) (+ M i))) (or (= l (+ M i (* (- 1) N))) (<= (+ 2 j) i) (< k N) (< (+ N j 1) (+ M i)) (<= M i)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (= l 0) (< k N) (< (+ N j 1) (+ M i)) (= l j) (<= (+ 2 j) l)) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (<= (+ 2 j) i) (not (= M l)) (< k N) (< (+ N j 1) (+ M i))) (or (= l (+ M i (* (- 1) N))) (not (= M i)) (= M l) (= l 0) (not (<= l 0)) (< k N) (< (+ N j 1) (+ M i)) (= l j)) (or (= l (+ M i (* (- 1) N))) (= (select A l) (select B l)) (not (= M i)) (= M l) (< k N) (< (+ N j 1) (+ M i)) (not (= l 0)) (= l j))), 1673962#(or (= (select A l) (select B l)) (< k N)), 1673965#(or (= (select A l) (select B l)) (< j M) (< k N)), 1673967#(or (= (select A l) (select B l)) (< (+ j 1) M) (not (< j M)) (< k N) (= l j)), 1673963#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (= j 0)) (or (< 2 i) (<= N i) (= l 0) (not (= (+ i 1) M)) (= (+ (- 1) i) l) (= l i) (<= 3 l)) (or (<= 2 i) (<= N i)) (or (<= (+ l 1) N) (< 2 i) (<= N i) (<= l M) (not (= (+ i 1) M)))), 1673966#(and (or (<= N (+ i 1)) (<= 1 i)) (or (<= N (+ i 1)) (<= (+ l 1) N) (not (= M (+ 2 i))) (<= l M) (< 1 i)) (or (<= N (+ i 1)) (not (= M (+ 2 i))) (= l 0) (< 1 i) (= l i) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1673971#(and (or (< 0 i) (<= N (+ 2 i)) (not (= (+ 3 i) M)) (= l 0) (= l (+ 2 i)) (<= 3 l) (= (+ i 1) l)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= 0 i)) (or (<= (+ l 1) N) (< 0 i) (<= N (+ 2 i)) (not (= (+ 3 i) M)) (<= l M)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 1673969#(and (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (< k N) (<= (+ j 1) l) (= l j)) (or (= (select A l) (select B l)) (not (= M i)) (= M l) (<= (+ N j 1) (+ M i)) (not (<= l 0)) (< k N) (= l j)) (or (<= (+ N j 1) (+ M i)) (< i (+ M 1)) (< k N) (<= N (+ M 1)) (= l j)) (or (<= (+ j 1) i) (<= (+ N j 1) (+ M i)) (< k N) (= l j) (<= M i)) (or (not (= M i)) (<= l M) (<= (+ N j 1) (+ M i)) (< k N) (= l j)))] [2022-03-15 22:26:51,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:26:51,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:26:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:26:51,113 INFO L87 Difference]: Start difference. First operand 9835 states and 45704 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:27:00,560 INFO L93 Difference]: Finished difference Result 10822 states and 48819 transitions. [2022-03-15 22:27:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 22:27:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 22:27:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:27:00,588 INFO L225 Difference]: With dead ends: 10822 [2022-03-15 22:27:00,588 INFO L226 Difference]: Without dead ends: 10805 [2022-03-15 22:27:00,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4221 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1858, Invalid=12904, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 22:27:00,589 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:27:00,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:27:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2022-03-15 22:27:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 9837. [2022-03-15 22:27:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9837 states, 9836 states have (on average 4.648535990239935) internal successors, (45723), 9836 states have internal predecessors, (45723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9837 states to 9837 states and 45723 transitions. [2022-03-15 22:27:00,779 INFO L78 Accepts]: Start accepts. Automaton has 9837 states and 45723 transitions. Word has length 19 [2022-03-15 22:27:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:27:00,780 INFO L470 AbstractCegarLoop]: Abstraction has 9837 states and 45723 transitions. [2022-03-15 22:27:00,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:27:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 9837 states and 45723 transitions. [2022-03-15 22:27:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:27:00,798 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:27:00,798 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:27:00,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Ended with exit code 0 [2022-03-15 22:27:00,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2022-03-15 22:27:00,998 INFO L402 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:27:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:27:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1080578536, now seen corresponding path program 135 times [2022-03-15 22:27:00,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:27:00,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352260473] [2022-03-15 22:27:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:27:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:27:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:27:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:01,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:27:01,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352260473] [2022-03-15 22:27:01,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352260473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:27:01,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041544027] [2022-03-15 22:27:01,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:27:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:27:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:27:01,601 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:27:01,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2022-03-15 22:27:01,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:27:01,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:27:01,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:27:01,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:27:01,814 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 22:27:01,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:01,844 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 20 treesize of output 22 [2022-03-15 22:27:01,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:01,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:27:01,875 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 31 treesize of output 36 [2022-03-15 22:27:01,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 22:27:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:27:02,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-03-15 22:27:02,151 WARN L244 SmtUtils]: Removed 4 from assertion stack [2022-03-15 22:27:02,152 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:27:02,152 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:27:02,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Ended with exit code 0 [2022-03-15 22:27:02,173 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:27:02,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2022-03-15 22:27:02,353 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 53 for 33ms.. [2022-03-15 22:27:02,354 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:27:02,354 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:27:02,355 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:27:02,356 INFO L732 BasicCegarLoop]: Path program histogram: [135, 33, 1, 1] [2022-03-15 22:27:02,357 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:27:02,357 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:27:02,358 INFO L202 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:27:02 BasicIcfg [2022-03-15 22:27:02,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:27:02,358 INFO L158 Benchmark]: Toolchain (without parser) took 746556.55ms. Allocated memory was 178.3MB in the beginning and 847.2MB in the end (delta: 669.0MB). Free memory was 141.0MB in the beginning and 418.3MB in the end (delta: -277.3MB). Peak memory consumption was 392.9MB. Max. memory is 8.0GB. [2022-03-15 22:27:02,358 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:27:02,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.38ms. Allocated memory is still 178.3MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:27:02,359 INFO L158 Benchmark]: Boogie Preprocessor took 14.36ms. Allocated memory is still 178.3MB. Free memory was 139.4MB in the beginning and 138.5MB in the end (delta: 885.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:27:02,359 INFO L158 Benchmark]: RCFGBuilder took 239.53ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 129.1MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:27:02,359 INFO L158 Benchmark]: TraceAbstraction took 746276.11ms. Allocated memory was 178.3MB in the beginning and 847.2MB in the end (delta: 669.0MB). Free memory was 128.6MB in the beginning and 418.3MB in the end (delta: -289.8MB). Peak memory consumption was 380.4MB. Max. memory is 8.0GB. [2022-03-15 22:27:02,359 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 178.3MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.38ms. Allocated memory is still 178.3MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.36ms. Allocated memory is still 178.3MB. Free memory was 139.4MB in the beginning and 138.5MB in the end (delta: 885.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.53ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 129.1MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 746276.11ms. Allocated memory was 178.3MB in the beginning and 847.2MB in the end (delta: 669.0MB). Free memory was 128.6MB in the beginning and 418.3MB in the end (delta: -289.8MB). Peak memory consumption was 380.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 25 PlacesAfterwards, 31 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 67, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 134, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 67, unknown conditional: 0, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 53 for 33ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 53 for 33ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 53 for 33ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 53 for 33ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 44 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 746.2s, OverallIterations: 170, TraceHistogramMax: 5, PathProgramHistogramMax: 135, EmptinessCheckTime: 1.0s, AutomataDifference: 455.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37148 SdHoareTripleChecker+Valid, 59.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37148 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 50.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30123 mSDsCounter, 18654 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104533 IncrementalHoareTripleChecker+Invalid, 123187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18654 mSolverCounterUnsat, 0 mSDtfsCounter, 104533 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16444 GetRequests, 4585 SyntacticMatches, 380 SemanticMatches, 11479 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 277073 ImplicationChecksByTransitivity, 480.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9837occurred in iteration=169, InterpolantAutomatonStates: 7910, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 169 MinimizatonAttempts, 135220 StatesRemovedByMinimization, 168 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 114.2s InterpolantComputationTime, 5663 NumberOfCodeBlocks, 5660 NumberOfCodeBlocksAsserted, 549 NumberOfCheckSat, 7980 ConstructedInterpolants, 542 QuantifiedInterpolants, 137505 SizeOfPredicates, 775 NumberOfNonLiveVariables, 12560 ConjunctsInSsa, 3196 ConjunctsInUnsatCore, 503 InterpolantComputations, 2 PerfectInterpolantSequences, 1270/5284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown